./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:23:56,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:23:56,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:23:56,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:23:56,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:23:56,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:23:56,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:23:56,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:23:56,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:23:56,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:23:56,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:23:56,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:23:56,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:23:56,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:23:56,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:23:56,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:23:56,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:23:56,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:23:56,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:23:56,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:23:56,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:23:56,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:23:56,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:23:56,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:23:56,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:23:56,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:23:56,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:56,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:23:56,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:23:56,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:23:56,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:23:56,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-11-20 06:23:57,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:23:57,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:23:57,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:23:57,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:23:57,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:23:57,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:23:58,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:23:58,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:23:58,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:23:58,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fb81ba4/237837108b7848008f8030e1d2986282/FLAGae84507ec [2024-11-20 06:23:58,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fb81ba4/237837108b7848008f8030e1d2986282 [2024-11-20 06:23:58,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:23:58,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:23:58,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:58,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:23:58,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:23:58,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:58,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f18b1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58, skipping insertion in model container [2024-11-20 06:23:58,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:58,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:23:58,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-20 06:23:58,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:58,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:23:58,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-20 06:23:58,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:58,975 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:23:58,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58 WrapperNode [2024-11-20 06:23:58,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:58,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:58,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:23:58,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:23:58,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:58,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,025 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-20 06:23:59,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:59,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:23:59,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:23:59,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:23:59,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:23:59,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:23:59,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:23:59,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:23:59,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:23:59,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (1/1) ... [2024-11-20 06:23:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:59,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:23:59,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:23:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:23:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:23:59,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:23:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:23:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:23:59,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:23:59,200 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:23:59,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:23:59,561 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 06:23:59,561 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:23:59,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:23:59,575 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:23:59,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:59 BoogieIcfgContainer [2024-11-20 06:23:59,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:23:59,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:23:59,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:23:59,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:23:59,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:23:58" (1/3) ... [2024-11-20 06:23:59,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8344b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:59, skipping insertion in model container [2024-11-20 06:23:59,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:58" (2/3) ... [2024-11-20 06:23:59,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8344b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:59, skipping insertion in model container [2024-11-20 06:23:59,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:59" (3/3) ... [2024-11-20 06:23:59,583 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:23:59,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:23:59,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:23:59,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:23:59,649 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e40e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:23:59,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:23:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 06:23:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 06:23:59,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:59,665 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:59,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 198294688, now seen corresponding path program 1 times [2024-11-20 06:23:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790575810] [2024-11-20 06:23:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790575810] [2024-11-20 06:24:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790575810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:24:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744903938] [2024-11-20 06:24:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:00,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:24:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:00,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:24:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:24:00,444 INFO L87 Difference]: Start difference. First operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 06:24:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:00,790 INFO L93 Difference]: Finished difference Result 294 states and 537 transitions. [2024-11-20 06:24:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:24:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-20 06:24:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:00,803 INFO L225 Difference]: With dead ends: 294 [2024-11-20 06:24:00,804 INFO L226 Difference]: Without dead ends: 196 [2024-11-20 06:24:00,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:24:00,811 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 228 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:00,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 547 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:24:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-20 06:24:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 100. [2024-11-20 06:24:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 06:24:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-20 06:24:00,873 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 206 [2024-11-20 06:24:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:00,875 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-20 06:24:00,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 06:24:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-20 06:24:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 06:24:00,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:00,881 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:00,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:24:00,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 878353058, now seen corresponding path program 1 times [2024-11-20 06:24:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563908794] [2024-11-20 06:24:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563908794] [2024-11-20 06:24:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563908794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:24:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957487961] [2024-11-20 06:24:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:24:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:24:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:01,413 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:01,475 INFO L93 Difference]: Finished difference Result 291 states and 458 transitions. [2024-11-20 06:24:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:24:01,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-20 06:24:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:01,481 INFO L225 Difference]: With dead ends: 291 [2024-11-20 06:24:01,482 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 06:24:01,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:01,484 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:01,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 289 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:24:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 06:24:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-20 06:24:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:24:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 300 transitions. [2024-11-20 06:24:01,535 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 300 transitions. Word has length 206 [2024-11-20 06:24:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:01,536 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 300 transitions. [2024-11-20 06:24:01,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2024-11-20 06:24:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 06:24:01,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:01,542 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:01,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:24:01,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:01,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -823403552, now seen corresponding path program 1 times [2024-11-20 06:24:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286840615] [2024-11-20 06:24:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286840615] [2024-11-20 06:24:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286840615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:24:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443345774] [2024-11-20 06:24:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:24:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:24:10,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:24:10,998 INFO L87 Difference]: Start difference. First operand 191 states and 300 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:11,861 INFO L93 Difference]: Finished difference Result 650 states and 1004 transitions. [2024-11-20 06:24:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:24:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-20 06:24:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:11,868 INFO L225 Difference]: With dead ends: 650 [2024-11-20 06:24:11,869 INFO L226 Difference]: Without dead ends: 462 [2024-11-20 06:24:11,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:24:11,870 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 424 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:11,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 627 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:24:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-20 06:24:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 271. [2024-11-20 06:24:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 191 states have internal predecessors, (269), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-20 06:24:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 421 transitions. [2024-11-20 06:24:11,913 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 421 transitions. Word has length 206 [2024-11-20 06:24:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:11,913 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 421 transitions. [2024-11-20 06:24:11,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 421 transitions. [2024-11-20 06:24:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 06:24:11,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:11,916 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:24:11,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -604548834, now seen corresponding path program 1 times [2024-11-20 06:24:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786011562] [2024-11-20 06:24:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786011562] [2024-11-20 06:24:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786011562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:24:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33576358] [2024-11-20 06:24:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:24:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:24:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:12,060 INFO L87 Difference]: Start difference. First operand 271 states and 421 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:12,126 INFO L93 Difference]: Finished difference Result 695 states and 1071 transitions. [2024-11-20 06:24:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:24:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-20 06:24:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:12,131 INFO L225 Difference]: With dead ends: 695 [2024-11-20 06:24:12,131 INFO L226 Difference]: Without dead ends: 446 [2024-11-20 06:24:12,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:12,134 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 134 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:12,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 414 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:24:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-20 06:24:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 371. [2024-11-20 06:24:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.375) internal successors, (352), 258 states have internal predecessors, (352), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 568 transitions. [2024-11-20 06:24:12,176 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 568 transitions. Word has length 206 [2024-11-20 06:24:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:12,177 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 568 transitions. [2024-11-20 06:24:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 568 transitions. [2024-11-20 06:24:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-20 06:24:12,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:12,183 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:12,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:24:12,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1625617188, now seen corresponding path program 1 times [2024-11-20 06:24:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:12,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797632934] [2024-11-20 06:24:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797632934] [2024-11-20 06:24:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797632934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:24:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551582206] [2024-11-20 06:24:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:24:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:24:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:24:12,442 INFO L87 Difference]: Start difference. First operand 371 states and 568 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:12,521 INFO L93 Difference]: Finished difference Result 770 states and 1176 transitions. [2024-11-20 06:24:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:24:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-20 06:24:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:12,524 INFO L225 Difference]: With dead ends: 770 [2024-11-20 06:24:12,524 INFO L226 Difference]: Without dead ends: 421 [2024-11-20 06:24:12,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:24:12,526 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 115 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:12,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 385 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:24:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-20 06:24:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2024-11-20 06:24:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.3671875) internal successors, (350), 258 states have internal predecessors, (350), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 566 transitions. [2024-11-20 06:24:12,559 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 566 transitions. Word has length 206 [2024-11-20 06:24:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:12,559 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 566 transitions. [2024-11-20 06:24:12,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 566 transitions. [2024-11-20 06:24:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 06:24:12,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:12,561 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:24:12,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2093744881, now seen corresponding path program 1 times [2024-11-20 06:24:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053328673] [2024-11-20 06:24:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053328673] [2024-11-20 06:24:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053328673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:12,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:24:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670300033] [2024-11-20 06:24:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:24:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:12,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:24:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:24:12,898 INFO L87 Difference]: Start difference. First operand 371 states and 566 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:12,983 INFO L93 Difference]: Finished difference Result 800 states and 1215 transitions. [2024-11-20 06:24:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:24:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-20 06:24:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:12,987 INFO L225 Difference]: With dead ends: 800 [2024-11-20 06:24:12,987 INFO L226 Difference]: Without dead ends: 438 [2024-11-20 06:24:12,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:24:12,990 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 332 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:12,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 306 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:24:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-20 06:24:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 373. [2024-11-20 06:24:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 258 states have (on average 1.3565891472868217) internal successors, (350), 260 states have internal predecessors, (350), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2024-11-20 06:24:13,028 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 207 [2024-11-20 06:24:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:13,029 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2024-11-20 06:24:13,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2024-11-20 06:24:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 06:24:13,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:13,031 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:13,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:24:13,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:13,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1867532374, now seen corresponding path program 1 times [2024-11-20 06:24:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440350161] [2024-11-20 06:24:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440350161] [2024-11-20 06:24:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440350161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:24:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830139099] [2024-11-20 06:24:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:24:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:24:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:24:13,298 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:13,366 INFO L93 Difference]: Finished difference Result 597 states and 905 transitions. [2024-11-20 06:24:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:24:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-20 06:24:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:13,370 INFO L225 Difference]: With dead ends: 597 [2024-11-20 06:24:13,370 INFO L226 Difference]: Without dead ends: 452 [2024-11-20 06:24:13,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:24:13,371 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 104 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:13,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 453 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:24:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-20 06:24:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 382. [2024-11-20 06:24:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 267 states have (on average 1.3595505617977528) internal successors, (363), 269 states have internal predecessors, (363), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 579 transitions. [2024-11-20 06:24:13,398 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 579 transitions. Word has length 207 [2024-11-20 06:24:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:13,398 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 579 transitions. [2024-11-20 06:24:13,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 579 transitions. [2024-11-20 06:24:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 06:24:13,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:13,401 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:13,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:24:13,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:13,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 725678312, now seen corresponding path program 1 times [2024-11-20 06:24:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395366845] [2024-11-20 06:24:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395366845] [2024-11-20 06:24:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395366845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:24:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803630399] [2024-11-20 06:24:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:24:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:24:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:24:21,922 INFO L87 Difference]: Start difference. First operand 382 states and 579 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:22,866 INFO L93 Difference]: Finished difference Result 670 states and 1003 transitions. [2024-11-20 06:24:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:24:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-20 06:24:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:22,871 INFO L225 Difference]: With dead ends: 670 [2024-11-20 06:24:22,874 INFO L226 Difference]: Without dead ends: 516 [2024-11-20 06:24:22,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:24:22,875 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 329 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:22,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 759 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:24:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-20 06:24:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 376. [2024-11-20 06:24:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 263 states have internal predecessors, (353), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 569 transitions. [2024-11-20 06:24:22,907 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 569 transitions. Word has length 207 [2024-11-20 06:24:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:22,909 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 569 transitions. [2024-11-20 06:24:22,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 569 transitions. [2024-11-20 06:24:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 06:24:22,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:22,926 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:22,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:24:22,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 811821820, now seen corresponding path program 1 times [2024-11-20 06:24:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264967698] [2024-11-20 06:24:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264967698] [2024-11-20 06:24:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264967698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:24:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354380581] [2024-11-20 06:24:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:24:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:39,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:24:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:24:39,545 INFO L87 Difference]: Start difference. First operand 376 states and 569 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:40,518 INFO L93 Difference]: Finished difference Result 860 states and 1287 transitions. [2024-11-20 06:24:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 06:24:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-20 06:24:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:40,521 INFO L225 Difference]: With dead ends: 860 [2024-11-20 06:24:40,521 INFO L226 Difference]: Without dead ends: 506 [2024-11-20 06:24:40,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:24:40,523 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 361 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:40,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 872 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 06:24:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-20 06:24:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 378. [2024-11-20 06:24:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 265 states have internal predecessors, (357), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:24:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 573 transitions. [2024-11-20 06:24:40,552 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 573 transitions. Word has length 207 [2024-11-20 06:24:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 573 transitions. [2024-11-20 06:24:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 573 transitions. [2024-11-20 06:24:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 06:24:40,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:40,558 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:40,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:24:40,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1982367697, now seen corresponding path program 1 times [2024-11-20 06:24:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840824631] [2024-11-20 06:24:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 06:24:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840824631] [2024-11-20 06:24:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840824631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:24:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646918611] [2024-11-20 06:24:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:40,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:24:40,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:24:40,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:24:40,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:24:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:40,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:24:40,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-11-20 06:24:41,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:24:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 06:24:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646918611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:24:41,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:24:41,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 06:24:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533898358] [2024-11-20 06:24:41,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:24:41,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:24:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:41,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:24:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:24:41,493 INFO L87 Difference]: Start difference. First operand 378 states and 573 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-20 06:24:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:41,665 INFO L93 Difference]: Finished difference Result 619 states and 922 transitions. [2024-11-20 06:24:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:24:41,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 207 [2024-11-20 06:24:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:41,667 INFO L225 Difference]: With dead ends: 619 [2024-11-20 06:24:41,667 INFO L226 Difference]: Without dead ends: 259 [2024-11-20 06:24:41,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:24:41,669 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:41,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 263 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:24:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-20 06:24:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-20 06:24:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.294478527607362) internal successors, (211), 164 states have internal predecessors, (211), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-20 06:24:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 363 transitions. [2024-11-20 06:24:41,690 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 363 transitions. Word has length 207 [2024-11-20 06:24:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:41,690 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 363 transitions. [2024-11-20 06:24:41,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-20 06:24:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 363 transitions. [2024-11-20 06:24:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 06:24:41,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:41,692 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:41,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 06:24:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 06:24:41,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2136677189, now seen corresponding path program 1 times [2024-11-20 06:24:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749681306] [2024-11-20 06:24:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:24:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:24:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:24:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:24:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:24:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:24:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:24:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:24:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:24:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:24:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:24:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:24:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:24:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:24:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:24:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:24:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:24:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:24:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:24:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:24:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:24:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 06:24:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:24:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 06:24:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:24:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 06:24:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:24:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 06:24:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 06:24:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 06:24:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 06:24:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 06:24:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 06:24:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:24:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749681306] [2024-11-20 06:24:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749681306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:24:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129021261] [2024-11-20 06:24:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:24:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:24:42,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:24:42,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:24:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:42,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:24:42,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-20 06:24:42,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:24:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 06:24:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129021261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:24:42,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:24:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 06:24:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493652230] [2024-11-20 06:24:42,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:24:42,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:24:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:24:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:24:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:24:42,542 INFO L87 Difference]: Start difference. First operand 247 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-20 06:24:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:42,698 INFO L93 Difference]: Finished difference Result 490 states and 709 transitions. [2024-11-20 06:24:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:24:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 208 [2024-11-20 06:24:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:42,701 INFO L225 Difference]: With dead ends: 490 [2024-11-20 06:24:42,701 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 06:24:42,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:24:42,702 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:42,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 259 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:24:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 06:24:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2024-11-20 06:24:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 169 states have (on average 1.272189349112426) internal successors, (215), 170 states have internal predecessors, (215), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-20 06:24:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 367 transitions. [2024-11-20 06:24:42,723 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 367 transitions. Word has length 208 [2024-11-20 06:24:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 367 transitions. [2024-11-20 06:24:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-20 06:24:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 367 transitions. [2024-11-20 06:24:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 06:24:42,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:42,724 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:42,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:24:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 06:24:42,925 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 352851773, now seen corresponding path program 1 times [2024-11-20 06:24:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:24:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653184021] [2024-11-20 06:24:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:24:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:24:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104225944] [2024-11-20 06:24:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:24:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:24:43,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:24:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 06:24:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:24:43,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:24:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:24:43,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:24:43,308 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:24:43,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:24:43,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 06:24:43,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:24:43,514 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:43,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:24:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:24:43 BoogieIcfgContainer [2024-11-20 06:24:43,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:24:43,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:24:43,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:24:43,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:24:43,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:59" (3/4) ... [2024-11-20 06:24:43,625 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:24:43,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:24:43,627 INFO L158 Benchmark]: Toolchain (without parser) took 45018.02ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,627 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 107.0MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:24:43,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.06ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 143.8MB in the end (delta: -33.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.65ms. Allocated memory is still 180.4MB. Free memory was 143.8MB in the beginning and 138.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,627 INFO L158 Benchmark]: Boogie Preprocessor took 48.53ms. Allocated memory is still 180.4MB. Free memory was 138.9MB in the beginning and 130.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,628 INFO L158 Benchmark]: RCFGBuilder took 497.35ms. Allocated memory is still 180.4MB. Free memory was 130.5MB in the beginning and 99.7MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,628 INFO L158 Benchmark]: TraceAbstraction took 44045.16ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2024-11-20 06:24:43,628 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:24:43,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 107.0MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.06ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 143.8MB in the end (delta: -33.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.65ms. Allocated memory is still 180.4MB. Free memory was 143.8MB in the beginning and 138.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.53ms. Allocated memory is still 180.4MB. Free memory was 138.9MB in the beginning and 130.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 497.35ms. Allocated memory is still 180.4MB. Free memory was 130.5MB in the beginning and 99.7MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44045.16ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_9 = 0; [L25] unsigned char var_1_10 = 1; [L26] signed char var_1_11 = -8; [L27] signed char var_1_12 = -50; [L28] signed char var_1_13 = 25; [L29] signed char var_1_14 = 100; [L30] signed char var_1_15 = 32; [L31] signed char var_1_16 = 25; [L32] signed long int var_1_17 = 50; [L33] signed long int var_1_18 = -32; [L34] signed short int var_1_19 = 256; [L35] unsigned long int var_1_20 = 64; [L36] unsigned char var_1_21 = 1; [L37] unsigned char var_1_22 = 0; [L38] float var_1_23 = 1.4; [L39] float var_1_24 = 3.875; [L40] float var_1_25 = 255.375; [L41] float var_1_26 = 0.65; [L42] float var_1_27 = 64.75; [L43] float var_1_28 = 3.5; [L44] signed long int var_1_29 = 16; [L45] unsigned char var_1_31 = 5; [L46] unsigned char var_1_32 = 128; [L47] unsigned char var_1_33 = 64; [L48] unsigned char var_1_34 = 2; [L49] signed short int var_1_35 = -128; [L50] signed short int var_1_36 = 19851; [L51] signed short int var_1_37 = 28837; [L52] float var_1_38 = 31.2; [L53] float var_1_39 = 127.6; [L54] unsigned long int last_1_var_1_20 = 64; VAL [isInitial=0, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L136] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L137] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L138] var_1_10 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L141] var_1_12 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L147] var_1_14 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L150] var_1_15 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L153] var_1_16 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L156] var_1_22 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L159] var_1_24 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L160] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L161] var_1_25 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L162] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L163] var_1_26 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L164] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L165] var_1_27 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L167] var_1_28 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_32 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_32 >= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L173] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L178] var_1_36 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_36 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_36 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L181] var_1_37 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_37 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_37 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_37 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] RET assume_abort_if_not(var_1_37 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L185] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L199] RET updateVariables() [L200] CALL step() [L58] var_1_17 = ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16)))) [L59] var_1_21 = (! (var_1_9 && var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L60] COND TRUE \read(var_1_21) [L61] var_1_23 = ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L63] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L66] COND FALSE !(\read(var_1_9)) [L73] var_1_38 = var_1_25 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L75] COND FALSE !((- var_1_23) == var_1_23) [L78] var_1_1 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L80] unsigned char stepLocal_0 = var_1_17 < var_1_31; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L81] COND FALSE !((127.35 + var_1_23) <= var_1_23) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L88] COND TRUE \read(var_1_21) [L89] var_1_11 = ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L93] COND FALSE !(\read(var_1_7)) [L96] var_1_18 = (var_1_15 + var_1_14) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] COND FALSE !(last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) [L101] var_1_20 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L103] COND FALSE !(\read(var_1_7)) [L106] var_1_29 = ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L108] unsigned char stepLocal_5 = (var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33))); [L109] signed long int stepLocal_4 = var_1_29; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L110] COND FALSE !(stepLocal_5 && var_1_21) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L115] COND TRUE var_1_31 == stepLocal_4 [L116] var_1_35 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L121] signed long int stepLocal_3 = var_1_17; [L122] unsigned char stepLocal_2 = var_1_10; [L123] signed short int stepLocal_1 = var_1_35; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_1=127, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L124] COND FALSE !((var_1_15 + var_1_17) == stepLocal_1) [L131] var_1_19 = ((((var_1_13) < (128)) ? (var_1_13) : (128))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191-L192] return ((((((((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31)))) && (var_1_21 == ((unsigned char) (! (var_1_9 && var_1_22))))) && (var_1_21 ? (var_1_23 == ((float) ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))))) : 1)) && (var_1_7 ? (var_1_29 == ((signed long int) ((1349734853 - var_1_16) - (1715174523 - var_1_31)))) : (var_1_29 == ((signed long int) ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))))))) && (var_1_22 ? (var_1_31 == ((unsigned char) ((((var_1_16) < ((var_1_32 - (var_1_33 - var_1_34)))) ? (var_1_16) : ((var_1_32 - (var_1_33 - var_1_34))))))) : 1)) && ((((var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33)))) && var_1_21) ? ((var_1_23 <= 0.125f) ? (var_1_35 == ((signed short int) ((((((var_1_36) < (var_1_37)) ? (var_1_36) : (var_1_37))) - var_1_33) - var_1_16))) : 1) : ((var_1_31 == var_1_29) ? (var_1_35 == ((signed short int) ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))) : (var_1_35 == ((signed short int) var_1_13))))) && (var_1_9 ? ((var_1_25 == var_1_26) ? (var_1_38 == ((float) (((((var_1_24) < (var_1_39)) ? (var_1_24) : (var_1_39))) + var_1_25))) : (var_1_38 == ((float) var_1_39))) : (var_1_38 == ((float) var_1_25))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.9s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2383 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2369 mSDsluCounter, 5174 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3314 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2085 IncrementalHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 1860 mSDtfsCounter, 2085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1623 GetRequests, 1555 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 844 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 3104 NumberOfCodeBlocks, 3104 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3088 ConstructedInterpolants, 0 QuantifiedInterpolants, 16125 SizeOfPredicates, 2 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 29346/29760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:24:43,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:24:45,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:24:45,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:24:45,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:24:45,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:24:45,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:24:45,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:24:45,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:24:45,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:24:45,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:24:45,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:24:45,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:24:45,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:24:45,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:24:45,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:24:45,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:24:45,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:24:45,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:24:45,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:24:45,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:24:45,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:24:45,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:24:45,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:24:45,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:24:45,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:24:45,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:24:45,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:24:45,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:24:45,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:24:45,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:24:45,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:24:45,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:24:45,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:24:45,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:24:45,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:24:45,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:24:45,628 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-11-20 06:24:45,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:24:45,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:24:45,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:24:45,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:24:45,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:24:45,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:24:47,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:24:47,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:24:47,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:24:47,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc010c5e9/fd03efaa32c84b5e831c1c9c66a5fa03/FLAG2fba8e16f [2024-11-20 06:24:47,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc010c5e9/fd03efaa32c84b5e831c1c9c66a5fa03 [2024-11-20 06:24:47,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:24:47,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:24:47,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:24:47,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:24:47,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:24:47,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c0b6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47, skipping insertion in model container [2024-11-20 06:24:47,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:24:47,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-20 06:24:47,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:24:47,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:24:47,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-20 06:24:47,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:24:47,685 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:24:47,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47 WrapperNode [2024-11-20 06:24:47,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:24:47,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:24:47,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:24:47,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:24:47,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,730 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-20 06:24:47,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:24:47,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:24:47,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:24:47,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:24:47,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,760 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:24:47,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:24:47,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:24:47,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:24:47,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:24:47,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (1/1) ... [2024-11-20 06:24:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:24:47,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:24:47,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:24:47,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:24:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:24:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:24:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:24:47,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:24:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:24:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:24:47,933 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:24:47,935 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:24:51,127 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 06:24:51,127 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:24:51,140 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:24:51,141 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:24:51,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:24:51 BoogieIcfgContainer [2024-11-20 06:24:51,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:24:51,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:24:51,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:24:51,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:24:51,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:24:47" (1/3) ... [2024-11-20 06:24:51,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:24:51, skipping insertion in model container [2024-11-20 06:24:51,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:24:47" (2/3) ... [2024-11-20 06:24:51,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:24:51, skipping insertion in model container [2024-11-20 06:24:51,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:24:51" (3/3) ... [2024-11-20 06:24:51,150 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-20 06:24:51,163 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:24:51,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:24:51,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:24:51,221 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c1357b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:24:51,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:24:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 06:24:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:24:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:51,254 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:51,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:51,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -668581297, now seen corresponding path program 1 times [2024-11-20 06:24:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:24:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146261457] [2024-11-20 06:24:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:24:51,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:24:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:24:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:51,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:24:51,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-20 06:24:51,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:24:51,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:24:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146261457] [2024-11-20 06:24:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146261457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:24:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983613372] [2024-11-20 06:24:51,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:51,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:24:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:24:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:24:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:24:51,786 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 06:24:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:51,820 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2024-11-20 06:24:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:24:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-20 06:24:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:51,829 INFO L225 Difference]: With dead ends: 173 [2024-11-20 06:24:51,830 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 06:24:51,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:24:51,839 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:51,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:24:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 06:24:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 06:24:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 06:24:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-20 06:24:51,885 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2024-11-20 06:24:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:51,887 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-20 06:24:51,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 06:24:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-20 06:24:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:24:51,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:51,891 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:51,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:24:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:52,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -398678841, now seen corresponding path program 1 times [2024-11-20 06:24:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:24:52,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201781463] [2024-11-20 06:24:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:24:52,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:24:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:24:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:52,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 06:24:52,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-20 06:24:52,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:24:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-20 06:24:53,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:24:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201781463] [2024-11-20 06:24:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201781463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:24:53,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:24:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 06:24:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928017333] [2024-11-20 06:24:53,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:24:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:24:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:24:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:24:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:24:53,203 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-20 06:24:55,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:24:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:55,281 INFO L93 Difference]: Finished difference Result 177 states and 272 transitions. [2024-11-20 06:24:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:24:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 203 [2024-11-20 06:24:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:55,304 INFO L225 Difference]: With dead ends: 177 [2024-11-20 06:24:55,304 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 06:24:55,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:24:55,306 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:55,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 223 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 06:24:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 06:24:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-20 06:24:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 06:24:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2024-11-20 06:24:55,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 203 [2024-11-20 06:24:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2024-11-20 06:24:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-20 06:24:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-11-20 06:24:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:24:55,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:55,326 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:55,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:24:55,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:55,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1902143749, now seen corresponding path program 1 times [2024-11-20 06:24:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:24:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512364025] [2024-11-20 06:24:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:24:55,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:24:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:24:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:55,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 06:24:55,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 06:24:56,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:24:56,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:24:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512364025] [2024-11-20 06:24:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512364025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:24:56,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:24:56,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:24:56,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376723011] [2024-11-20 06:24:56,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:24:56,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:24:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:24:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:24:56,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:56,293 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:58,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:24:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:24:58,157 INFO L93 Difference]: Finished difference Result 264 states and 402 transitions. [2024-11-20 06:24:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:24:58,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-20 06:24:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:24:58,181 INFO L225 Difference]: With dead ends: 264 [2024-11-20 06:24:58,181 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 06:24:58,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:24:58,182 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:24:58,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 253 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 06:24:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 06:24:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-11-20 06:24:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:24:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2024-11-20 06:24:58,222 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 203 [2024-11-20 06:24:58,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:24:58,223 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2024-11-20 06:24:58,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 06:24:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2024-11-20 06:24:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:24:58,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:24:58,229 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:24:58,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:24:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:58,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:24:58,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:24:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1767282177, now seen corresponding path program 1 times [2024-11-20 06:24:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:24:58,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555555522] [2024-11-20 06:24:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:58,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:24:58,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:24:58,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:24:58,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 06:25:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:05,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 06:25:05,966 INFO L278 TraceCheckSpWp]: Computing forward predicates...