./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_operatoramount_amount100_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:16:40,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:16:40,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:16:40,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:16:40,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:16:40,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:16:40,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:16:40,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:16:40,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:16:40,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:16:40,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:16:40,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:16:40,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:16:40,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:16:40,557 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:16:40,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:16:40,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:16:40,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:16:40,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:16:40,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:16:40,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:16:40,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:16:40,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:16:40,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:16:40,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:16:40,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:16:40,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:16:40,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:16:40,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:16:40,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:16:40,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:16:40,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:16:40,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:40,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:16:40,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:16:40,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:16:40,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:16:40,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:16:40,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:16:40,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:16:40,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:16:40,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:16:40,568 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-clean/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-clean/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 -> 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 [2024-10-11 12:16:40,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:16:40,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:16:40,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:16:40,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:16:40,867 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:16:40,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2024-10-11 12:16:42,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:16:42,652 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:16:42,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2024-10-11 12:16:42,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7b34e95d8/5c354866e81d4cbab735e8e78b264150/FLAG9460ec17a [2024-10-11 12:16:42,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7b34e95d8/5c354866e81d4cbab735e8e78b264150 [2024-10-11 12:16:42,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:16:42,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:16:42,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:42,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:16:42,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:16:42,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:42" (1/1) ... [2024-10-11 12:16:42,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c930b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:42, skipping insertion in model container [2024-10-11 12:16:42,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:42" (1/1) ... [2024-10-11 12:16:42,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:16:42,933 WARN L248 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_operatoramount_amount100_file-89.i[916,929] [2024-10-11 12:16:43,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:43,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:16:43,068 WARN L248 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_operatoramount_amount100_file-89.i[916,929] [2024-10-11 12:16:43,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:43,168 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:16:43,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43 WrapperNode [2024-10-11 12:16:43,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:43,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:43,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:16:43,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:16:43,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,250 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 264 [2024-10-11 12:16:43,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:43,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:16:43,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:16:43,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:16:43,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,326 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-10-11 12:16:43,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:16:43,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:16:43,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:16:43,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:16:43,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (1/1) ... [2024-10-11 12:16:43,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:43,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:43,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:16:43,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:16:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:16:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:16:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:16:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:16:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:16:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:16:43,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:16:43,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:16:44,269 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 12:16:44,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:16:44,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:16:44,337 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:16:44,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:44 BoogieIcfgContainer [2024-10-11 12:16:44,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:16:44,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:16:44,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:16:44,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:16:44,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:16:42" (1/3) ... [2024-10-11 12:16:44,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4013188d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:44, skipping insertion in model container [2024-10-11 12:16:44,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:43" (2/3) ... [2024-10-11 12:16:44,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4013188d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:44, skipping insertion in model container [2024-10-11 12:16:44,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:44" (3/3) ... [2024-10-11 12:16:44,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-89.i [2024-10-11 12:16:44,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:16:44,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:16:44,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:16:44,454 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;@72489da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:16:44,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:16:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:16:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 12:16:44,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:44,482 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:44,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash 171583231, now seen corresponding path program 1 times [2024-10-11 12:16:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125361396] [2024-10-11 12:16:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125361396] [2024-10-11 12:16:45,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125361396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:16:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264175123] [2024-10-11 12:16:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:16:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:16:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:16:45,377 INFO L87 Difference]: Start difference. First operand has 110 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:16:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:45,488 INFO L93 Difference]: Finished difference Result 217 states and 390 transitions. [2024-10-11 12:16:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:16:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 233 [2024-10-11 12:16:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:45,516 INFO L225 Difference]: With dead ends: 217 [2024-10-11 12:16:45,520 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 12:16:45,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-10-11 12:16:45,534 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:45,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:16:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 12:16:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 12:16:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:16:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2024-10-11 12:16:45,605 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 233 [2024-10-11 12:16:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:45,606 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2024-10-11 12:16:45,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:16:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2024-10-11 12:16:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 12:16:45,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:45,617 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:45,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:16:45,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1074380283, now seen corresponding path program 1 times [2024-10-11 12:16:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190655363] [2024-10-11 12:16:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190655363] [2024-10-11 12:16:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190655363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:16:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340075584] [2024-10-11 12:16:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:16:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:16:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:16:46,161 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:46,303 INFO L93 Difference]: Finished difference Result 308 states and 486 transitions. [2024-10-11 12:16:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:16:46,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 12:16:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:46,309 INFO L225 Difference]: With dead ends: 308 [2024-10-11 12:16:46,312 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 12:16:46,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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-10-11 12:16:46,317 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 157 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:46,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 396 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:16:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 12:16:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 120. [2024-10-11 12:16:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:16:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 189 transitions. [2024-10-11 12:16:46,355 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 189 transitions. Word has length 233 [2024-10-11 12:16:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:46,358 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 189 transitions. [2024-10-11 12:16:46,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 189 transitions. [2024-10-11 12:16:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 12:16:46,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:46,369 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:46,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:16:46,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1332545721, now seen corresponding path program 1 times [2024-10-11 12:16:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305015798] [2024-10-11 12:16:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305015798] [2024-10-11 12:16:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305015798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:16:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750212361] [2024-10-11 12:16:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:16:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:16:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:16:47,530 INFO L87 Difference]: Start difference. First operand 120 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:47,819 INFO L93 Difference]: Finished difference Result 316 states and 491 transitions. [2024-10-11 12:16:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:16:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 12:16:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:47,825 INFO L225 Difference]: With dead ends: 316 [2024-10-11 12:16:47,825 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 12:16:47,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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-10-11 12:16:47,829 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 266 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:47,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 351 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:16:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 12:16:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 143. [2024-10-11 12:16:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:16:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2024-10-11 12:16:47,859 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 233 [2024-10-11 12:16:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:47,860 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2024-10-11 12:16:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2024-10-11 12:16:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 12:16:47,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:47,865 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:16:47,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 256731833, now seen corresponding path program 1 times [2024-10-11 12:16:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002104432] [2024-10-11 12:16:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:48,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002104432] [2024-10-11 12:16:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002104432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:49,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:49,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:16:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448841057] [2024-10-11 12:16:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:16:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:16:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:16:49,010 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:50,163 INFO L93 Difference]: Finished difference Result 415 states and 622 transitions. [2024-10-11 12:16:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:16:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 12:16:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:50,167 INFO L225 Difference]: With dead ends: 415 [2024-10-11 12:16:50,167 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 12:16:50,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:16:50,170 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 302 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:50,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 775 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 12:16:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 12:16:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 157. [2024-10-11 12:16:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:16:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2024-10-11 12:16:50,207 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 233 [2024-10-11 12:16:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:50,208 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2024-10-11 12:16:50,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2024-10-11 12:16:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 12:16:50,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:50,213 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:50,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:16:50,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1274461756, now seen corresponding path program 1 times [2024-10-11 12:16:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833930712] [2024-10-11 12:16:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833930712] [2024-10-11 12:16:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833930712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:16:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445589939] [2024-10-11 12:16:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:16:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:16:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:16:50,739 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:51,242 INFO L93 Difference]: Finished difference Result 526 states and 790 transitions. [2024-10-11 12:16:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:16:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 234 [2024-10-11 12:16:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:51,247 INFO L225 Difference]: With dead ends: 526 [2024-10-11 12:16:51,248 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 12:16:51,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:16:51,250 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 204 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:51,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 596 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:16:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 12:16:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 293. [2024-10-11 12:16:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 212 states have (on average 1.3443396226415094) internal successors, (285), 212 states have internal predecessors, (285), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:16:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2024-10-11 12:16:51,310 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 234 [2024-10-11 12:16:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:51,314 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2024-10-11 12:16:51,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2024-10-11 12:16:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 12:16:51,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:51,318 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:16:51,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:51,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash -453482216, now seen corresponding path program 1 times [2024-10-11 12:16:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561553899] [2024-10-11 12:16:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561553899] [2024-10-11 12:16:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561553899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:53,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:53,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 12:16:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421857609] [2024-10-11 12:16:53,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:53,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:16:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:53,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:16:53,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:16:53,466 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:55,256 INFO L93 Difference]: Finished difference Result 611 states and 904 transitions. [2024-10-11 12:16:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:16:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 235 [2024-10-11 12:16:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:55,260 INFO L225 Difference]: With dead ends: 611 [2024-10-11 12:16:55,261 INFO L226 Difference]: Without dead ends: 455 [2024-10-11 12:16:55,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:16:55,264 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 159 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:55,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1522 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 12:16:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-11 12:16:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 298. [2024-10-11 12:16:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 217 states have (on average 1.3502304147465438) internal successors, (293), 217 states have internal predecessors, (293), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:16:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2024-10-11 12:16:55,324 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 235 [2024-10-11 12:16:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:55,325 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2024-10-11 12:16:55,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2024-10-11 12:16:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 12:16:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:55,328 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:16:55,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 111936812, now seen corresponding path program 1 times [2024-10-11 12:16:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481667732] [2024-10-11 12:16:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481667732] [2024-10-11 12:16:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481667732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:56,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:56,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:16:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603179211] [2024-10-11 12:16:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:16:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:16:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:16:56,317 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:56,902 INFO L93 Difference]: Finished difference Result 820 states and 1211 transitions. [2024-10-11 12:16:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:16:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 235 [2024-10-11 12:16:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:56,907 INFO L225 Difference]: With dead ends: 820 [2024-10-11 12:16:56,907 INFO L226 Difference]: Without dead ends: 523 [2024-10-11 12:16:56,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:16:56,912 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 210 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:56,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 712 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:16:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-11 12:16:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 300. [2024-10-11 12:16:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 219 states have (on average 1.356164383561644) internal successors, (297), 219 states have internal predecessors, (297), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:16:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 449 transitions. [2024-10-11 12:16:56,964 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 449 transitions. Word has length 235 [2024-10-11 12:16:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:56,966 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 449 transitions. [2024-10-11 12:16:56,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:16:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 449 transitions. [2024-10-11 12:16:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 12:16:56,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:56,969 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:16:56,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:16:56,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:56,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1617831426, now seen corresponding path program 1 times [2024-10-11 12:16:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511878112] [2024-10-11 12:16:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:16:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:16:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:16:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:16:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:16:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:16:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:16:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:16:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:16:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:16:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511878112] [2024-10-11 12:16:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511878112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:16:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252339243] [2024-10-11 12:16:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:16:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:16:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:16:58,476 INFO L87 Difference]: Start difference. First operand 300 states and 449 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:17:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:00,298 INFO L93 Difference]: Finished difference Result 786 states and 1171 transitions. [2024-10-11 12:17:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 12:17:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 236 [2024-10-11 12:17:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:00,305 INFO L225 Difference]: With dead ends: 786 [2024-10-11 12:17:00,305 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 12:17:00,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-11 12:17:00,308 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 349 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:00,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1573 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 12:17:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 12:17:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 285. [2024-10-11 12:17:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 204 states have (on average 1.338235294117647) internal successors, (273), 204 states have internal predecessors, (273), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:17:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2024-10-11 12:17:00,360 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 236 [2024-10-11 12:17:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:00,361 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2024-10-11 12:17:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:17:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2024-10-11 12:17:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 12:17:00,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:00,364 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:00,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:17:00,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:00,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1757258906, now seen corresponding path program 1 times [2024-10-11 12:17:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:17:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243401100] [2024-10-11 12:17:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:17:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:17:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:17:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:17:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:17:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:17:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:17:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:17:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:17:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:17:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:17:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:17:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:17:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:17:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:17:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:17:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:17:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:17:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:17:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:17:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:17:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:17:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:17:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:17:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:17:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:17:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:17:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:17:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:17:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:17:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:17:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:17:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:17:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:17:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:17:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:17:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:17:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:17:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:17:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 12:17:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:17:01,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243401100] [2024-10-11 12:17:01,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243401100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:17:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:17:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:17:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485134727] [2024-10-11 12:17:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:17:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:17:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:17:01,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:17:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:17:01,471 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:17:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:02,120 INFO L93 Difference]: Finished difference Result 557 states and 830 transitions. [2024-10-11 12:17:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:17:02,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 236 [2024-10-11 12:17:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:02,125 INFO L225 Difference]: With dead ends: 557 [2024-10-11 12:17:02,125 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 12:17:02,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:17:02,128 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 184 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:02,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 852 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:17:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 12:17:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 263. [2024-10-11 12:17:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 182 states have internal predecessors, (239), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:17:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2024-10-11 12:17:02,180 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 236 [2024-10-11 12:17:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:02,181 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2024-10-11 12:17:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 12:17:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2024-10-11 12:17:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 12:17:02,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:02,185 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:02,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:17:02,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -998495318, now seen corresponding path program 1 times [2024-10-11 12:17:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:17:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52319558] [2024-10-11 12:17:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:17:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:17:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:17:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:17:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:17:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:17:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:17:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:17:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:17:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:17:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:17:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:17:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:17:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:17:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:17:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:17:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:17:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:17:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:17:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:17:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:17:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:17:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:17:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:17:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:17:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:17:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:17:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:17:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:17:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:17:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:17:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:17:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:17:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:17:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:17:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 12:17:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 12:17:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 12:17:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 12:17:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 12:17:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:17:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52319558] [2024-10-11 12:17:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52319558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:17:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378684967] [2024-10-11 12:17:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:17:02,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:17:02,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:17:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:03,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 12:17:03,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 514 proven. 276 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2024-10-11 12:17:04,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:17:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 78 proven. 141 refuted. 0 times theorem prover too weak. 2593 trivial. 0 not checked. [2024-10-11 12:17:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378684967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:17:04,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:17:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 9] total 22 [2024-10-11 12:17:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221313189] [2024-10-11 12:17:04,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:17:04,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 12:17:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:17:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 12:17:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2024-10-11 12:17:04,794 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 6 states have call successors, (108), 4 states have call predecessors, (108), 8 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2024-10-11 12:17:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:05,395 INFO L93 Difference]: Finished difference Result 565 states and 813 transitions. [2024-10-11 12:17:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 12:17:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 6 states have call successors, (108), 4 states have call predecessors, (108), 8 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) Word has length 236 [2024-10-11 12:17:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:05,401 INFO L225 Difference]: With dead ends: 565 [2024-10-11 12:17:05,401 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 12:17:05,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-10-11 12:17:05,403 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 214 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:05,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 532 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:17:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 12:17:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 295. [2024-10-11 12:17:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 206 states have (on average 1.2572815533980584) internal successors, (259), 206 states have internal predecessors, (259), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 12:17:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 411 transitions. [2024-10-11 12:17:05,463 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 411 transitions. Word has length 236 [2024-10-11 12:17:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:05,463 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 411 transitions. [2024-10-11 12:17:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 6 states have call successors, (108), 4 states have call predecessors, (108), 8 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2024-10-11 12:17:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 411 transitions. [2024-10-11 12:17:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 12:17:05,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:05,468 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:05,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:17:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 12:17:05,669 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -799945223, now seen corresponding path program 1 times [2024-10-11 12:17:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:17:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017458875] [2024-10-11 12:17:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:17:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:17:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909477189] [2024-10-11 12:17:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:05,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:17:05,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:17:05,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:17:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:17:06,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:17:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:17:06,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:17:06,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:17:06,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:17:06,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:17:07,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:07,053 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:17:07,226 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:17:07,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:17:07 BoogieIcfgContainer [2024-10-11 12:17:07,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:17:07,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:17:07,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:17:07,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:17:07,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:44" (3/4) ... [2024-10-11 12:17:07,234 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:17:07,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:17:07,235 INFO L158 Benchmark]: Toolchain (without parser) took 24539.44ms. Allocated memory was 125.8MB in the beginning and 432.0MB in the end (delta: 306.2MB). Free memory was 56.2MB in the beginning and 181.0MB in the end (delta: -124.8MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,236 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:17:07,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.30ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 55.8MB in the beginning and 124.0MB in the end (delta: -68.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.36ms. Allocated memory is still 165.7MB. Free memory was 124.0MB in the beginning and 116.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,237 INFO L158 Benchmark]: Boogie Preprocessor took 137.80ms. Allocated memory is still 165.7MB. Free memory was 116.7MB in the beginning and 103.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,237 INFO L158 Benchmark]: RCFGBuilder took 948.06ms. Allocated memory is still 165.7MB. Free memory was 103.0MB in the beginning and 59.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,237 INFO L158 Benchmark]: TraceAbstraction took 22890.37ms. Allocated memory was 165.7MB in the beginning and 432.0MB in the end (delta: 266.3MB). Free memory was 57.9MB in the beginning and 182.0MB in the end (delta: -124.1MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. [2024-10-11 12:17:07,237 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 432.0MB. Free memory was 182.0MB in the beginning and 181.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:17:07,239 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.16ms. Allocated memory is still 125.8MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.30ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 55.8MB in the beginning and 124.0MB in the end (delta: -68.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.36ms. Allocated memory is still 165.7MB. Free memory was 124.0MB in the beginning and 116.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 137.80ms. Allocated memory is still 165.7MB. Free memory was 116.7MB in the beginning and 103.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 948.06ms. Allocated memory is still 165.7MB. Free memory was 103.0MB in the beginning and 59.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22890.37ms. Allocated memory was 165.7MB in the beginning and 432.0MB in the end (delta: 266.3MB). Free memory was 57.9MB in the beginning and 182.0MB in the end (delta: -124.1MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 432.0MB. Free memory was 182.0MB in the beginning and 181.0MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 214, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 128; [L23] unsigned long int var_1_5 = 2082256544; [L24] unsigned long int var_1_6 = 32; [L25] unsigned long int var_1_7 = 2478717280; [L26] signed short int var_1_8 = 256; [L27] unsigned char var_1_11 = 100; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 16; [L31] double var_1_15 = -0.5; [L32] double var_1_16 = 99.6; [L33] double var_1_17 = 10.75; [L34] double var_1_18 = 5.5; [L35] signed short int var_1_19 = 128; [L36] unsigned long int var_1_20 = 5; [L37] unsigned char var_1_21 = 2; [L38] unsigned char var_1_22 = 128; [L39] unsigned short int var_1_23 = 256; [L40] unsigned short int var_1_24 = 37558; [L41] unsigned long int var_1_25 = 10000; [L42] double var_1_27 = 4.2; [L43] unsigned char var_1_29 = 0; [L44] unsigned char var_1_30 = 1; [L45] unsigned char var_1_31 = 1; [L46] unsigned char var_1_32 = 0; [L47] unsigned char var_1_33 = 0; [L48] unsigned char var_1_34 = 0; [L49] unsigned char var_1_35 = 25; [L50] unsigned char var_1_36 = 2; [L51] unsigned char var_1_37 = 8; [L52] unsigned char var_1_38 = 10; [L53] unsigned long int var_1_39 = 1000000; [L54] signed long int var_1_40 = 32; [L55] unsigned short int var_1_41 = 0; [L56] unsigned long int var_1_42 = 100; [L57] unsigned long int last_1_var_1_1 = 128; [L58] signed short int last_1_var_1_8 = 256; [L59] unsigned long int last_1_var_1_25 = 10000; [L60] unsigned char last_1_var_1_35 = 25; [L61] unsigned long int last_1_var_1_39 = 1000000; [L218] isInitial = 1 [L219] FCALL initially() [L220] COND TRUE 1 [L221] CALL updateLastVariables() [L207] last_1_var_1_1 = var_1_1 [L208] last_1_var_1_8 = var_1_8 [L209] last_1_var_1_25 = var_1_25 [L210] last_1_var_1_35 = var_1_35 [L211] last_1_var_1_39 = var_1_39 [L221] RET updateLastVariables() [L222] CALL updateVariables() [L148] var_1_5 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_5 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L149] RET assume_abort_if_not(var_1_5 >= 1073741823) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L150] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L150] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=2478717280, var_1_8=256] [L151] var_1_7 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L152] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L153] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L153] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L154] var_1_12 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L155] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L156] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L156] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L157] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L157] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=100, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L158] var_1_13 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L159] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L160] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L161] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L161] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=16, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L162] var_1_14 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L163] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L164] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L164] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_16=498/5, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L165] var_1_16 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L166] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_17=43/4, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L167] var_1_17 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_18=11/2, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L169] var_1_18 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L170] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=5, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L171] var_1_20 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L172] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L173] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L173] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L174] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L174] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=128, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L175] var_1_22 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_22 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L176] RET assume_abort_if_not(var_1_22 >= 127) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L177] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L177] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=37558, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L178] var_1_24 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L179] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L180] CALL assume_abort_if_not(var_1_24 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L180] RET assume_abort_if_not(var_1_24 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_27=21/5, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L181] var_1_27 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L182] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L183] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L183] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L184] var_1_30 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L185] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L186] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L186] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L187] var_1_32 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L188] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L189] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L189] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L190] var_1_33 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L191] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L192] CALL assume_abort_if_not(var_1_33 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L192] RET assume_abort_if_not(var_1_33 <= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L193] var_1_34 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L194] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L195] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L195] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=2, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L196] var_1_36 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L197] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L198] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L198] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=8, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L199] var_1_37 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L200] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L201] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L201] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=10, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L202] var_1_38 = __VERIFIER_nondet_uchar() [L203] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L203] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L204] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L204] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=100, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L222] RET updateVariables() [L223] CALL step() [L65] COND TRUE (last_1_var_1_35 / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) == (last_1_var_1_1 * (last_1_var_1_39 * var_1_5)) [L66] var_1_11 = ((((var_1_14) < (10)) ? (var_1_14) : (10))) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L68] var_1_15 = (var_1_16 - ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18)))) [L69] var_1_29 = (! var_1_30) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L70] COND FALSE !(\read(var_1_29)) [L73] var_1_31 = (var_1_32 || (var_1_33 || var_1_34)) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=1000000, var_1_40=32, var_1_41=0, var_1_42=100, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L75] var_1_39 = (4u + 10u) [L76] var_1_41 = var_1_12 [L77] var_1_42 = var_1_7 [L78] unsigned char stepLocal_5 = var_1_17 > var_1_18; [L79] unsigned long int stepLocal_4 = var_1_42; VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L80] COND FALSE !(var_1_18 < var_1_15) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L91] unsigned long int stepLocal_6 = var_1_7; VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_6=3221225307, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L92] COND FALSE !(stepLocal_6 < var_1_41) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=10000, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L95] COND TRUE (var_1_17 / var_1_27) <= var_1_15 [L96] var_1_25 = var_1_42 VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L101] unsigned long int stepLocal_0 = var_1_39; VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_0=14, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L102] COND TRUE stepLocal_0 != var_1_21 VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L103] COND FALSE !(\read(var_1_29)) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=256] [L107] COND FALSE !(var_1_29 && var_1_31) [L118] var_1_8 = var_1_21 VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=256, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L120] COND TRUE ! var_1_29 [L121] var_1_23 = (var_1_24 - var_1_1) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L123] signed long int stepLocal_8 = (((var_1_11) < (8)) ? (var_1_11) : (8)); [L124] signed long int stepLocal_7 = 64; VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_7=64, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L125] COND FALSE !(var_1_21 > stepLocal_7) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L132] unsigned long int stepLocal_2 = var_1_5; [L133] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_1=0, stepLocal_2=5368709120, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L134] COND FALSE !(var_1_23 > stepLocal_2) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_1=0, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L139] unsigned long int stepLocal_3 = var_1_5 - (var_1_12 + var_1_14); VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_1=0, stepLocal_3=5368709065, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=128, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L140] COND TRUE stepLocal_3 == (var_1_7 / ((((var_1_13) > (var_1_20)) ? (var_1_13) : (var_1_20)))) [L141] var_1_19 = ((((((var_1_35) > (4)) ? (var_1_35) : (4))) - var_1_13) + var_1_12) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, stepLocal_1=0, stepLocal_4=3221225307, stepLocal_5=1, stepLocal_8=8, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=32, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L145] var_1_40 = ((((var_1_37) < (var_1_35)) ? (var_1_37) : (var_1_35))) [L223] RET step() [L224] CALL, EXPR property() [L214] EXPR (((var_1_39 != var_1_21) ? (var_1_29 ? (var_1_1 == ((unsigned long int) ((var_1_5 + 1668503833u) - (50u + 256u)))) : 1) : 1) && ((var_1_23 > var_1_5) ? (((var_1_5 < var_1_23) || var_1_31) ? (var_1_6 == ((unsigned long int) (var_1_7 - var_1_5))) : 1) : 1)) && ((var_1_29 && var_1_31) ? ((var_1_5 < var_1_7) ? ((var_1_41 <= (5u ^ last_1_var_1_8)) ? (var_1_8 == ((signed short int) var_1_21)) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=25, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L214] EXPR (var_1_29 && var_1_31) ? ((var_1_5 < var_1_7) ? ((var_1_41 <= (5u ^ last_1_var_1_8)) ? (var_1_8 == ((signed short int) var_1_21)) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21)) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=25, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L214] EXPR (((var_1_39 != var_1_21) ? (var_1_29 ? (var_1_1 == ((unsigned long int) ((var_1_5 + 1668503833u) - (50u + 256u)))) : 1) : 1) && ((var_1_23 > var_1_5) ? (((var_1_5 < var_1_23) || var_1_31) ? (var_1_6 == ((unsigned long int) (var_1_7 - var_1_5))) : 1) : 1)) && ((var_1_29 && var_1_31) ? ((var_1_5 < var_1_7) ? ((var_1_41 <= (5u ^ last_1_var_1_8)) ? (var_1_8 == ((signed short int) var_1_21)) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=25, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L214-L215] return ((((((((((((((((var_1_39 != var_1_21) ? (var_1_29 ? (var_1_1 == ((unsigned long int) ((var_1_5 + 1668503833u) - (50u + 256u)))) : 1) : 1) && ((var_1_23 > var_1_5) ? (((var_1_5 < var_1_23) || var_1_31) ? (var_1_6 == ((unsigned long int) (var_1_7 - var_1_5))) : 1) : 1)) && ((var_1_29 && var_1_31) ? ((var_1_5 < var_1_7) ? ((var_1_41 <= (5u ^ last_1_var_1_8)) ? (var_1_8 == ((signed short int) var_1_21)) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21))) : (var_1_8 == ((signed short int) var_1_21)))) && (((last_1_var_1_35 / ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))) == (last_1_var_1_1 * (last_1_var_1_39 * var_1_5))) ? (var_1_11 == ((unsigned char) ((((var_1_14) < (10)) ? (var_1_14) : (10))))) : 1)) && (var_1_15 == ((double) (var_1_16 - ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))))) && (((var_1_5 - (var_1_12 + var_1_14)) == (var_1_7 / ((((var_1_13) > (var_1_20)) ? (var_1_13) : (var_1_20))))) ? (var_1_19 == ((signed short int) ((((((var_1_35) > (4)) ? (var_1_35) : (4))) - var_1_13) + var_1_12))) : (var_1_19 == ((signed short int) var_1_14)))) && ((var_1_18 < var_1_15) ? ((var_1_42 >= 200) ? (var_1_21 == ((unsigned char) ((((25) < (var_1_14)) ? (25) : (var_1_14))))) : ((var_1_31 || (var_1_17 > var_1_18)) ? (var_1_21 == ((unsigned char) ((((var_1_22 - 1) < 0 ) ? -(var_1_22 - 1) : (var_1_22 - 1))))) : (var_1_21 == ((unsigned char) var_1_22)))) : 1)) && ((! var_1_29) ? (var_1_23 == ((unsigned short int) (var_1_24 - var_1_1))) : 1)) && ((var_1_7 < var_1_41) ? (var_1_25 == ((unsigned long int) ((((last_1_var_1_25) < (var_1_22)) ? (last_1_var_1_25) : (var_1_22))))) : (((var_1_17 / var_1_27) <= var_1_15) ? (var_1_25 == ((unsigned long int) var_1_42)) : (var_1_25 == ((unsigned long int) 10000000u))))) && (var_1_29 == ((unsigned char) (! var_1_30)))) && (var_1_29 ? (var_1_31 == ((unsigned char) (! var_1_30))) : (var_1_31 == ((unsigned char) (var_1_32 || (var_1_33 || var_1_34)))))) && ((var_1_21 > 64) ? ((var_1_8 < ((((var_1_11) < (8)) ? (var_1_11) : (8)))) ? (var_1_35 == ((unsigned char) (var_1_36 + ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38)))))) : (var_1_35 == ((unsigned char) (((((((((var_1_22 - var_1_38)) < (var_1_14)) ? ((var_1_22 - var_1_38)) : (var_1_14)))) > (var_1_37)) ? ((((((var_1_22 - var_1_38)) < (var_1_14)) ? ((var_1_22 - var_1_38)) : (var_1_14)))) : (var_1_37)))))) : 1)) && (var_1_39 == ((unsigned long int) (4u + 10u)))) && (var_1_40 == ((signed long int) ((((var_1_37) < (var_1_35)) ? (var_1_37) : (var_1_35)))))) && (var_1_41 == ((unsigned short int) var_1_12))) && (var_1_42 == ((unsigned long int) var_1_7)) ; [L224] RET, EXPR property() [L224] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=25, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, last_1_var_1_25=10000, last_1_var_1_35=25, last_1_var_1_39=1000000, last_1_var_1_8=256, var_1_11=10, var_1_12=31, var_1_13=259, var_1_14=24, var_1_19=53, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=254, var_1_23=65406, var_1_24=131070, var_1_25=3221225307, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=25, var_1_36=0, var_1_37=127, var_1_38=0, var_1_39=14, var_1_40=25, var_1_41=31, var_1_42=3221225307, var_1_5=5368709120, var_1_6=32, var_1_7=3221225307, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 11, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2060 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2045 mSDsluCounter, 7475 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5215 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3751 IncrementalHoareTripleChecker+Invalid, 4136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 2260 mSDtfsCounter, 3751 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1374 GetRequests, 1287 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=7, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 3054 NumberOfCodeBlocks, 3054 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2804 ConstructedInterpolants, 0 QuantifiedInterpolants, 10608 SizeOfPredicates, 5 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 33222/33744 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-10-11 12:17:07,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:17:09,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:17:09,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:17:09,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:17:09,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:17:09,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:17:09,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:17:09,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:17:09,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:17:09,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:17:09,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:17:09,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:17:09,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:17:09,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:17:09,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:17:09,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:17:09,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:17:09,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:17:09,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:17:09,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:17:09,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:17:09,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:17:09,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:17:09,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:17:09,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:17:09,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:17:09,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:17:09,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:17:09,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:17:09,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:17:09,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:17:09,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:17:09,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:17:09,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:17:09,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:17:09,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:17:09,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:17:09,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:17:09,754 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:17:09,754 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:17:09,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:17:09,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:17:09,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:17:09,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:17:09,756 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:17:09,756 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-clean/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-clean/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 -> 0b29ac98a85c5671f74af5656694b90e325003b38bb486d3b8562135cfd086b0 [2024-10-11 12:17:10,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:17:10,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:17:10,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:17:10,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:17:10,127 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:17:10,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2024-10-11 12:17:11,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:17:12,035 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:17:12,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-89.i [2024-10-11 12:17:12,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3c310c691/9c36c7f1384740178bb975c75ef2aff5/FLAGa283a3e40 [2024-10-11 12:17:12,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3c310c691/9c36c7f1384740178bb975c75ef2aff5 [2024-10-11 12:17:12,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:17:12,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:17:12,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:17:12,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:17:12,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:17:12,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795cb996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12, skipping insertion in model container [2024-10-11 12:17:12,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:17:12,624 WARN L248 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_operatoramount_amount100_file-89.i[916,929] [2024-10-11 12:17:12,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:17:12,759 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:17:12,771 WARN L248 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_operatoramount_amount100_file-89.i[916,929] [2024-10-11 12:17:12,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:17:12,857 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:17:12,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12 WrapperNode [2024-10-11 12:17:12,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:17:12,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:17:12,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:17:12,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:17:12,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,924 INFO L138 Inliner]: procedures = 27, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-10-11 12:17:12,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:17:12,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:17:12,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:17:12,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:17:12,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,983 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-10-11 12:17:12,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:12,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:17:13,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:17:13,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:17:13,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:17:13,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (1/1) ... [2024-10-11 12:17:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:17:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:17:13,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:17:13,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:17:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:17:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:17:13,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:17:13,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:17:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:17:13,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:17:13,233 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:17:13,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:17:23,457 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 12:17:23,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:17:23,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:17:23,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:17:23,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:23 BoogieIcfgContainer [2024-10-11 12:17:23,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:17:23,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:17:23,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:17:23,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:17:23,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:17:12" (1/3) ... [2024-10-11 12:17:23,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6186486a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:23, skipping insertion in model container [2024-10-11 12:17:23,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:12" (2/3) ... [2024-10-11 12:17:23,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6186486a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:23, skipping insertion in model container [2024-10-11 12:17:23,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:23" (3/3) ... [2024-10-11 12:17:23,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-89.i [2024-10-11 12:17:23,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:17:23,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:17:23,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:17:23,638 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;@75d06db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:17:23,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:17:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:17:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 12:17:23,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:23,674 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:23,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -692932987, now seen corresponding path program 1 times [2024-10-11 12:17:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:17:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206188512] [2024-10-11 12:17:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:23,696 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-10-11 12:17:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:17:23,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 12:17:23,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:17:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:24,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:17:24,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 2330 trivial. 0 not checked. [2024-10-11 12:17:24,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:17:24,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:17:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206188512] [2024-10-11 12:17:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206188512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:17:24,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:17:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:17:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844326808] [2024-10-11 12:17:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:17:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:17:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:17:24,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:17:24,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:17:24,865 INFO L87 Difference]: Start difference. First operand has 95 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:17:29,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:17:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:29,246 INFO L93 Difference]: Finished difference Result 187 states and 342 transitions. [2024-10-11 12:17:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:17:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 231 [2024-10-11 12:17:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:29,358 INFO L225 Difference]: With dead ends: 187 [2024-10-11 12:17:29,359 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 12:17:29,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 230 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-10-11 12:17:29,365 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:29,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 12:17:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 12:17:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 12:17:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:17:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 148 transitions. [2024-10-11 12:17:29,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 148 transitions. Word has length 231 [2024-10-11 12:17:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:29,414 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 148 transitions. [2024-10-11 12:17:29,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:17:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 148 transitions. [2024-10-11 12:17:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 12:17:29,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:29,420 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:29,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 12:17:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 12:17:29,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1748227201, now seen corresponding path program 1 times [2024-10-11 12:17:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:17:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552742477] [2024-10-11 12:17:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:29,623 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-10-11 12:17:29,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:17:29,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 12:17:29,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:17:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:30,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:17:30,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1333 proven. 39 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2024-10-11 12:17:33,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:17:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 72 proven. 39 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 12:17:37,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:17:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552742477] [2024-10-11 12:17:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552742477] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:17:37,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:17:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 12:17:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914482214] [2024-10-11 12:17:37,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:17:37,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:17:37,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:17:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:17:37,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:17:37,013 INFO L87 Difference]: Start difference. First operand 93 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-10-11 12:17:45,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:17:49,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:17:53,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:17:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:53,443 INFO L93 Difference]: Finished difference Result 189 states and 296 transitions. [2024-10-11 12:17:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:17:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 231 [2024-10-11 12:17:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:53,548 INFO L225 Difference]: With dead ends: 189 [2024-10-11 12:17:53,548 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 12:17:53,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:17:53,551 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 140 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:53,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 201 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 211 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2024-10-11 12:17:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 12:17:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-11 12:17:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:17:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2024-10-11 12:17:53,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 231 [2024-10-11 12:17:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:53,582 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2024-10-11 12:17:53,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-10-11 12:17:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2024-10-11 12:17:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 12:17:53,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:53,586 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:17:53,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 12:17:53,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 12:17:53,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -245917505, now seen corresponding path program 1 times [2024-10-11 12:17:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:17:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076974670] [2024-10-11 12:17:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:53,790 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-10-11 12:17:53,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:17:53,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 12:17:53,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:17:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:54,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:17:54,749 INFO L278 TraceCheckSpWp]: Computing forward predicates...