./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db54be3d9f8497342bca581078b31c3a59011e5e7c5b276c7ee614fb1a4f3efd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:04:05,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:04:06,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:04:06,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:04:06,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:04:06,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:04:06,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:04:06,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:04:06,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:04:06,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:04:06,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:04:06,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:04:06,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:04:06,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:04:06,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:04:06,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:04:06,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:04:06,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:04:06,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:04:06,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:04:06,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:04:06,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:04:06,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:04:06,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:04:06,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:04:06,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:04:06,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:04:06,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:04:06,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:04:06,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:04:06,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:04:06,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:04:06,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:04:06,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:04:06,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:04:06,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:04:06,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:04:06,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db54be3d9f8497342bca581078b31c3a59011e5e7c5b276c7ee614fb1a4f3efd [2024-11-12 06:04:06,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:04:06,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:04:06,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:04:06,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:04:06,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:04:06,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:08,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:04:08,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:04:08,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:08,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ce9fe7c/61017f18148047fa847f2e7c36b4b0db/FLAG085e3f748 [2024-11-12 06:04:09,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ce9fe7c/61017f18148047fa847f2e7c36b4b0db [2024-11-12 06:04:09,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:04:09,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:04:09,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:04:09,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:04:09,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:04:09,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9bcd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09, skipping insertion in model container [2024-11-12 06:04:09,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:04:09,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i[916,929] [2024-11-12 06:04:09,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:04:09,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:04:09,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i[916,929] [2024-11-12 06:04:09,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:04:09,579 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:04:09,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09 WrapperNode [2024-11-12 06:04:09,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:04:09,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:04:09,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:04:09,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:04:09,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,648 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 280 [2024-11-12 06:04:09,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:04:09,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:04:09,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:04:09,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:04:09,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:04:09,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:04:09,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:04:09,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:04:09,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:04:09,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (1/1) ... [2024-11-12 06:04:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:04:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:04:09,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:04:09,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:04:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:04:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:04:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:04:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:04:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:04:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:04:10,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:04:10,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:04:10,438 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-12 06:04:10,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:04:10,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:04:10,452 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:04:10,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:04:10 BoogieIcfgContainer [2024-11-12 06:04:10,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:04:10,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:04:10,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:04:10,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:04:10,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:04:09" (1/3) ... [2024-11-12 06:04:10,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c052d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:04:10, skipping insertion in model container [2024-11-12 06:04:10,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:09" (2/3) ... [2024-11-12 06:04:10,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c052d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:04:10, skipping insertion in model container [2024-11-12 06:04:10,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:04:10" (3/3) ... [2024-11-12 06:04:10,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:10,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:04:10,473 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:04:10,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:04:10,526 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;@eb08978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:04:10,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:04:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 06:04:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 06:04:10,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:10,541 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:10,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -56536703, now seen corresponding path program 1 times [2024-11-12 06:04:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:10,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273656601] [2024-11-12 06:04:10,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273656601] [2024-11-12 06:04:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273656601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:10,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:04:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877499766] [2024-11-12 06:04:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:10,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:04:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:04:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:04:10,990 INFO L87 Difference]: Start difference. First operand has 116 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 06:04:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:11,028 INFO L93 Difference]: Finished difference Result 225 states and 376 transitions. [2024-11-12 06:04:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:04:11,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 181 [2024-11-12 06:04:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:11,080 INFO L225 Difference]: With dead ends: 225 [2024-11-12 06:04:11,082 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 06:04:11,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:04:11,097 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:11,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:04:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 06:04:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 06:04:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 06:04:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2024-11-12 06:04:11,210 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 181 [2024-11-12 06:04:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2024-11-12 06:04:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 06:04:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2024-11-12 06:04:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 06:04:11,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:11,219 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:11,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:04:11,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:11,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1318224245, now seen corresponding path program 1 times [2024-11-12 06:04:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65921844] [2024-11-12 06:04:11,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:11,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65921844] [2024-11-12 06:04:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65921844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:04:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266078236] [2024-11-12 06:04:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:04:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:04:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:04:11,789 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:12,011 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2024-11-12 06:04:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:04:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 181 [2024-11-12 06:04:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:12,021 INFO L225 Difference]: With dead ends: 331 [2024-11-12 06:04:12,021 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 06:04:12,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:12,024 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 148 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:12,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 484 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:04:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 06:04:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2024-11-12 06:04:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 143 states have internal predecessors, (199), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:04:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 303 transitions. [2024-11-12 06:04:12,073 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 303 transitions. Word has length 181 [2024-11-12 06:04:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:12,076 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 303 transitions. [2024-11-12 06:04:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 303 transitions. [2024-11-12 06:04:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 06:04:12,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:12,081 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:12,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:04:12,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 86883325, now seen corresponding path program 1 times [2024-11-12 06:04:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267985604] [2024-11-12 06:04:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267985604] [2024-11-12 06:04:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267985604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:04:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362580508] [2024-11-12 06:04:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:12,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:04:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:04:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:04:12,806 INFO L87 Difference]: Start difference. First operand 198 states and 303 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:12,890 INFO L93 Difference]: Finished difference Result 447 states and 684 transitions. [2024-11-12 06:04:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:04:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-11-12 06:04:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:12,893 INFO L225 Difference]: With dead ends: 447 [2024-11-12 06:04:12,893 INFO L226 Difference]: Without dead ends: 324 [2024-11-12 06:04:12,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:04:12,901 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 161 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:12,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 432 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:04:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-12 06:04:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 202. [2024-11-12 06:04:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 147 states have (on average 1.380952380952381) internal successors, (203), 147 states have internal predecessors, (203), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:04:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 307 transitions. [2024-11-12 06:04:12,959 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 307 transitions. Word has length 183 [2024-11-12 06:04:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 307 transitions. [2024-11-12 06:04:12,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 307 transitions. [2024-11-12 06:04:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 06:04:12,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:12,967 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:04:12,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:12,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash 818508274, now seen corresponding path program 1 times [2024-11-12 06:04:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151887590] [2024-11-12 06:04:12,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151887590] [2024-11-12 06:04:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151887590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:04:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306821429] [2024-11-12 06:04:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:04:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:04:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:04:13,584 INFO L87 Difference]: Start difference. First operand 202 states and 307 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:13,873 INFO L93 Difference]: Finished difference Result 512 states and 777 transitions. [2024-11-12 06:04:13,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:04:13,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 184 [2024-11-12 06:04:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:13,876 INFO L225 Difference]: With dead ends: 512 [2024-11-12 06:04:13,876 INFO L226 Difference]: Without dead ends: 365 [2024-11-12 06:04:13,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:13,883 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 205 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:13,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 531 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:04:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-12 06:04:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 340. [2024-11-12 06:04:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 258 states have (on average 1.3992248062015504) internal successors, (361), 258 states have internal predecessors, (361), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 06:04:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 517 transitions. [2024-11-12 06:04:13,963 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 517 transitions. Word has length 184 [2024-11-12 06:04:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:13,966 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 517 transitions. [2024-11-12 06:04:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 517 transitions. [2024-11-12 06:04:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 06:04:13,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:13,972 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:04:13,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1716475311, now seen corresponding path program 1 times [2024-11-12 06:04:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760468802] [2024-11-12 06:04:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760468802] [2024-11-12 06:04:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760468802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:04:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152576914] [2024-11-12 06:04:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:15,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:04:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:04:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:15,034 INFO L87 Difference]: Start difference. First operand 340 states and 517 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:15,244 INFO L93 Difference]: Finished difference Result 754 states and 1131 transitions. [2024-11-12 06:04:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:04:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 186 [2024-11-12 06:04:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:15,248 INFO L225 Difference]: With dead ends: 754 [2024-11-12 06:04:15,248 INFO L226 Difference]: Without dead ends: 475 [2024-11-12 06:04:15,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:04:15,250 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 203 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:15,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 702 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:04:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-12 06:04:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 415. [2024-11-12 06:04:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.4144144144144144) internal successors, (471), 333 states have internal predecessors, (471), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 06:04:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2024-11-12 06:04:15,279 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 186 [2024-11-12 06:04:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:15,279 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2024-11-12 06:04:15,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2024-11-12 06:04:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 06:04:15,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:15,281 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:04:15,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:15,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1876892111, now seen corresponding path program 1 times [2024-11-12 06:04:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224629973] [2024-11-12 06:04:15,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224629973] [2024-11-12 06:04:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224629973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:15,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:04:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105498802] [2024-11-12 06:04:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:04:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:04:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:15,582 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:15,778 INFO L93 Difference]: Finished difference Result 1475 states and 2231 transitions. [2024-11-12 06:04:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:04:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 186 [2024-11-12 06:04:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:15,785 INFO L225 Difference]: With dead ends: 1475 [2024-11-12 06:04:15,785 INFO L226 Difference]: Without dead ends: 1130 [2024-11-12 06:04:15,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:04:15,787 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 429 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:15,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 818 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:04:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-12 06:04:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1124. [2024-11-12 06:04:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 934 states have (on average 1.4004282655246252) internal successors, (1308), 934 states have internal predecessors, (1308), 182 states have call successors, (182), 7 states have call predecessors, (182), 7 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-12 06:04:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1672 transitions. [2024-11-12 06:04:15,841 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1672 transitions. Word has length 186 [2024-11-12 06:04:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1672 transitions. [2024-11-12 06:04:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1672 transitions. [2024-11-12 06:04:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 06:04:15,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:15,845 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:04:15,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:15,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash 829727283, now seen corresponding path program 1 times [2024-11-12 06:04:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622992714] [2024-11-12 06:04:15,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622992714] [2024-11-12 06:04:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622992714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:04:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730804407] [2024-11-12 06:04:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:04:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:04:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:04:16,237 INFO L87 Difference]: Start difference. First operand 1124 states and 1672 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:16,407 INFO L93 Difference]: Finished difference Result 2152 states and 3188 transitions. [2024-11-12 06:04:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:04:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 186 [2024-11-12 06:04:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:16,413 INFO L225 Difference]: With dead ends: 2152 [2024-11-12 06:04:16,413 INFO L226 Difference]: Without dead ends: 1102 [2024-11-12 06:04:16,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:16,416 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 121 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:16,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 466 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:04:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-12 06:04:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1058. [2024-11-12 06:04:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 868 states have (on average 1.381336405529954) internal successors, (1199), 868 states have internal predecessors, (1199), 182 states have call successors, (182), 7 states have call predecessors, (182), 7 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-12 06:04:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1563 transitions. [2024-11-12 06:04:16,500 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1563 transitions. Word has length 186 [2024-11-12 06:04:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:16,501 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1563 transitions. [2024-11-12 06:04:16,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1563 transitions. [2024-11-12 06:04:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 06:04:16,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:16,503 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:04:16,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1893792812, now seen corresponding path program 1 times [2024-11-12 06:04:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159904384] [2024-11-12 06:04:16,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:04:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:04:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:04:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:04:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:04:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:04:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:04:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:04:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:04:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:04:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:04:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:04:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:04:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:04:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:04:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 06:04:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 06:04:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 06:04:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 06:04:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 06:04:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 06:04:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 06:04:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 06:04:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 06:04:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 06:04:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 06:04:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:16,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:04:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159904384] [2024-11-12 06:04:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159904384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:16,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:04:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473715513] [2024-11-12 06:04:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:16,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:04:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:04:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:04:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:16,810 INFO L87 Difference]: Start difference. First operand 1058 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:16,980 INFO L93 Difference]: Finished difference Result 1323 states and 1950 transitions. [2024-11-12 06:04:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:04:16,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 188 [2024-11-12 06:04:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:16,985 INFO L225 Difference]: With dead ends: 1323 [2024-11-12 06:04:16,985 INFO L226 Difference]: Without dead ends: 821 [2024-11-12 06:04:16,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:04:16,987 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 247 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:16,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 633 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:04:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-12 06:04:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 775. [2024-11-12 06:04:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 612 states have (on average 1.3676470588235294) internal successors, (837), 612 states have internal predecessors, (837), 156 states have call successors, (156), 6 states have call predecessors, (156), 6 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 06:04:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1149 transitions. [2024-11-12 06:04:17,031 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1149 transitions. Word has length 188 [2024-11-12 06:04:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1149 transitions. [2024-11-12 06:04:17,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1149 transitions. [2024-11-12 06:04:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 06:04:17,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:17,033 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:04:17,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 233058352, now seen corresponding path program 1 times [2024-11-12 06:04:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:04:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627459408] [2024-11-12 06:04:17,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:04:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:04:17,213 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:04:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:04:17,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:04:17,479 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:04:17,480 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:04:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 06:04:17,489 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:17,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:04:17,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:04:17 BoogieIcfgContainer [2024-11-12 06:04:17,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:04:17,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:04:17,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:04:17,748 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:04:17,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:04:10" (3/4) ... [2024-11-12 06:04:17,752 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:04:17,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:04:17,757 INFO L158 Benchmark]: Toolchain (without parser) took 8537.74ms. Allocated memory was 360.7MB in the beginning and 478.2MB in the end (delta: 117.4MB). Free memory was 318.7MB in the beginning and 391.0MB in the end (delta: -72.2MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,757 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 114.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:04:17,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.57ms. Allocated memory is still 360.7MB. Free memory was 318.5MB in the beginning and 313.6MB in the end (delta: 4.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.30ms. Allocated memory is still 360.7MB. Free memory was 313.6MB in the beginning and 308.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,758 INFO L158 Benchmark]: Boogie Preprocessor took 102.67ms. Allocated memory is still 360.7MB. Free memory was 308.4MB in the beginning and 301.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,758 INFO L158 Benchmark]: RCFGBuilder took 700.18ms. Allocated memory is still 360.7MB. Free memory was 301.0MB in the beginning and 263.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,759 INFO L158 Benchmark]: TraceAbstraction took 7293.00ms. Allocated memory was 360.7MB in the beginning and 478.2MB in the end (delta: 117.4MB). Free memory was 262.2MB in the beginning and 391.0MB in the end (delta: -128.7MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. [2024-11-12 06:04:17,759 INFO L158 Benchmark]: Witness Printer took 8.58ms. Allocated memory is still 478.2MB. Free memory is still 391.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:04:17,763 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.10ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 114.3MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.57ms. Allocated memory is still 360.7MB. Free memory was 318.5MB in the beginning and 313.6MB in the end (delta: 4.9MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.30ms. Allocated memory is still 360.7MB. Free memory was 313.6MB in the beginning and 308.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.67ms. Allocated memory is still 360.7MB. Free memory was 308.4MB in the beginning and 301.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 700.18ms. Allocated memory is still 360.7MB. Free memory was 301.0MB in the beginning and 263.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7293.00ms. Allocated memory was 360.7MB in the beginning and 478.2MB in the end (delta: 117.4MB). Free memory was 262.2MB in the beginning and 391.0MB in the end (delta: -128.7MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. * Witness Printer took 8.58ms. Allocated memory is still 478.2MB. Free memory is still 391.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 someBinaryFLOATComparisonOperation at line 155, overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 10; [L24] unsigned char var_1_5 = 4; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 127.25; [L27] float var_1_8 = 128.5; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 0; [L30] signed long int var_1_13 = -10; [L31] unsigned char var_1_14 = 1; [L32] signed char var_1_16 = -1; [L33] signed char var_1_17 = -5; [L34] signed char var_1_18 = 2; [L35] double var_1_19 = 256.7; [L36] double var_1_20 = 256.5; [L37] double var_1_21 = 5.058; [L38] double var_1_22 = 2.4; [L39] double var_1_23 = 5.875; [L40] signed long int var_1_24 = -128; [L41] unsigned long int var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned long int var_1_27 = 4189380979; [L44] unsigned char var_1_28 = 0; [L45] unsigned char var_1_29 = 0; [L46] unsigned long int var_1_30 = 2; [L47] unsigned long int var_1_31 = 1701266831; [L48] unsigned long int var_1_32 = 1169870883; [L49] double var_1_33 = 4.3; [L50] double var_1_34 = 7.25; [L51] unsigned short int var_1_35 = 32; [L52] unsigned char last_1_var_1_1 = 1; [L53] unsigned char last_1_var_1_6 = 1; [L54] signed char last_1_var_1_16 = -1; [L55] double last_1_var_1_19 = 256.7; [L56] signed long int last_1_var_1_24 = -128; [L57] unsigned long int last_1_var_1_25 = 128; [L58] unsigned long int last_1_var_1_30 = 2; [L59] double last_1_var_1_33 = 4.3; VAL [isInitial=0, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=10, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_6 = var_1_6 [L192] last_1_var_1_16 = var_1_16 [L193] last_1_var_1_19 = var_1_19 [L194] last_1_var_1_24 = var_1_24 [L195] last_1_var_1_25 = var_1_25 [L196] last_1_var_1_30 = var_1_30 [L197] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=10, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L152] var_1_7 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_8=257/2] [L153] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1, var_1_8=257/2] [L154] var_1_8 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L155] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L158] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L158] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L161] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L161] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L163] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L164] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L164] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L165] var_1_18 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L166] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L167] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L167] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L168] var_1_20 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L169] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L171] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L173] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L174] var_1_23 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L175] RET assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L176] var_1_27 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_27 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L177] RET assume_abort_if_not(var_1_27 >= 3221225471) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L178] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L178] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L182] var_1_31 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_31 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L183] RET assume_abort_if_not(var_1_31 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L184] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L184] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L185] var_1_32 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L186] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L187] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L187] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L208] RET updateVariables() [L209] CALL step() [L63] COND TRUE last_1_var_1_6 || last_1_var_1_6 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L64] EXPR last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L64] COND FALSE !((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) [L68] COND TRUE last_1_var_1_33 > last_1_var_1_33 [L69] var_1_28 = (! ((var_1_4 != last_1_var_1_24) || var_1_29)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L71] unsigned long int stepLocal_6 = (var_1_27 - last_1_var_1_1) - var_1_4; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=3221225343, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L72] EXPR last_1_var_1_30 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=3221225343, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L72] COND TRUE stepLocal_6 > (last_1_var_1_30 & last_1_var_1_25) [L73] var_1_26 = (var_1_4 + 4) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L77] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_0=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L78] COND FALSE !(var_1_28 && stepLocal_0) [L81] var_1_1 = ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_24=-128, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709247, var_1_32=1073741824, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=127, var_1_5=127, var_1_6=1] [L83] var_1_30 = ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) [L84] var_1_33 = var_1_20 [L85] var_1_34 = var_1_22 [L86] var_1_35 = var_1_30 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=1] [L87] COND FALSE !(var_1_18 <= (~ var_1_4)) [L94] var_1_24 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=1] [L96] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=1] [L97] COND FALSE !(var_1_7 > var_1_33) [L104] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=1] [L106] COND FALSE !(((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) [L113] var_1_6 = 0 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L115] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_2=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L116] COND FALSE !(stepLocal_2 && var_1_6) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L119] COND FALSE !(\read(var_1_28)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L123] signed long int stepLocal_5 = var_1_13; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_5=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L124] EXPR var_1_24 | var_1_35 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_5=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L124] signed long int stepLocal_4 = var_1_24 | var_1_35; [L125] COND TRUE (10000 / 64) >= stepLocal_4 [L126] var_1_25 = ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_5=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L134] signed char stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_3=0, stepLocal_5=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L135] COND FALSE !((var_1_16 ^ 1) >= stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=127, stepLocal_5=127, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR ((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L200] EXPR ((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L200] EXPR (((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L200-L201] return ((((((((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((last_1_var_1_33 > last_1_var_1_33) ? (var_1_28 == ((unsigned char) (! ((var_1_4 != last_1_var_1_24) || var_1_29)))) : 1)) && (var_1_30 == ((unsigned long int) ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (var_1_33 == ((double) var_1_20))) && (var_1_34 == ((double) var_1_22))) && (var_1_35 == ((unsigned short int) var_1_30)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=127, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=0, var_1_19=2567/10, var_1_1=127, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=127, var_1_26=131, var_1_27=3221225471, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709247, var_1_32=1073741824, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=127, var_1_5=127, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1514 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1514 mSDsluCounter, 4235 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2691 mSDsCounter, 493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 493 mSolverCounterUnsat, 1544 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1124occurred in iteration=6, InterpolantAutomatonStates: 35, 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, 8 MinimizatonAttempts, 327 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1663 NumberOfCodeBlocks, 1663 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1467 ConstructedInterpolants, 0 QuantifiedInterpolants, 2820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 10400/10400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:04:17,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db54be3d9f8497342bca581078b31c3a59011e5e7c5b276c7ee614fb1a4f3efd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:04:20,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:04:20,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:04:20,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:04:20,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:04:20,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:04:20,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:04:20,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:04:20,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:04:20,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:04:20,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:04:20,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:04:20,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:04:20,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:04:20,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:04:20,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:04:20,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:04:20,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:04:20,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:04:20,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:04:20,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:04:20,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:04:20,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:04:20,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:04:20,353 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:04:20,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:04:20,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:04:20,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:04:20,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:04:20,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:04:20,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:04:20,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:04:20,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:04:20,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:04:20,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:04:20,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:04:20,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:04:20,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:04:20,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:04:20,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:04:20,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:04:20,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:04:20,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:04:20,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:04:20,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db54be3d9f8497342bca581078b31c3a59011e5e7c5b276c7ee614fb1a4f3efd [2024-11-12 06:04:20,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:04:20,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:04:20,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:04:20,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:04:20,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:04:20,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:22,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:04:22,819 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:04:22,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:22,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de27fb46/21b36875767145e0bf564e385cef6c56/FLAGe9bc22695 [2024-11-12 06:04:22,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de27fb46/21b36875767145e0bf564e385cef6c56 [2024-11-12 06:04:22,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:04:22,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:04:22,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:04:22,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:04:22,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:04:22,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:04:22" (1/1) ... [2024-11-12 06:04:22,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637ebefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:22, skipping insertion in model container [2024-11-12 06:04:22,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:04:22" (1/1) ... [2024-11-12 06:04:22,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:04:23,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i[916,929] [2024-11-12 06:04:23,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:04:23,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:04:23,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-43.i[916,929] [2024-11-12 06:04:23,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:04:23,255 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:04:23,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23 WrapperNode [2024-11-12 06:04:23,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:04:23,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:04:23,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:04:23,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:04:23,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,320 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-12 06:04:23,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:04:23,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:04:23,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:04:23,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:04:23,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,366 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:04:23,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:04:23,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:04:23,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:04:23,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:04:23,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (1/1) ... [2024-11-12 06:04:23,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:04:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:04:23,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:04:23,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:04:23,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:04:23,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:04:23,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:04:23,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:04:23,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:04:23,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:04:23,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:04:23,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:04:35,625 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 06:04:35,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:04:35,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:04:35,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:04:35,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:04:35 BoogieIcfgContainer [2024-11-12 06:04:35,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:04:35,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:04:35,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:04:35,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:04:35,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:04:22" (1/3) ... [2024-11-12 06:04:35,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6122b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:04:35, skipping insertion in model container [2024-11-12 06:04:35,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:04:23" (2/3) ... [2024-11-12 06:04:35,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6122b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:04:35, skipping insertion in model container [2024-11-12 06:04:35,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:04:35" (3/3) ... [2024-11-12 06:04:35,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-43.i [2024-11-12 06:04:35,706 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:04:35,710 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:04:35,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:04:35,856 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;@48418f40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:04:35,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:04:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 06:04:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 06:04:35,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:35,894 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:35,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 834439615, now seen corresponding path program 1 times [2024-11-12 06:04:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:04:35,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387173150] [2024-11-12 06:04:35,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:35,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:04:35,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:04:35,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:04:35,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:04:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:36,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:04:36,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:04:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 06:04:36,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:04:36,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:04:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387173150] [2024-11-12 06:04:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387173150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:04:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995180522] [2024-11-12 06:04:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:36,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:04:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:04:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:04:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:04:36,729 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 06:04:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:36,765 INFO L93 Difference]: Finished difference Result 165 states and 284 transitions. [2024-11-12 06:04:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:04:36,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-12 06:04:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:36,774 INFO L225 Difference]: With dead ends: 165 [2024-11-12 06:04:36,774 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 06:04:36,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:04:36,781 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:36,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:04:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 06:04:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 06:04:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 06:04:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-12 06:04:36,820 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 172 [2024-11-12 06:04:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:36,821 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-12 06:04:36,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 06:04:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-12 06:04:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 06:04:36,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:36,824 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:36,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:04:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:04:37,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:04:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:04:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 287278089, now seen corresponding path program 1 times [2024-11-12 06:04:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:04:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135713707] [2024-11-12 06:04:37,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:04:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:04:37,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:04:37,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:04:37,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:04:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:04:37,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 06:04:37,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:04:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:04:40,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:04:40,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:04:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135713707] [2024-11-12 06:04:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135713707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:04:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:04:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:04:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938898679] [2024-11-12 06:04:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:04:40,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:04:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:04:40,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:04:40,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:04:40,483 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:42,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:04:47,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:04:51,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:04:55,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:04:59,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:04:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:04:59,717 INFO L93 Difference]: Finished difference Result 241 states and 367 transitions. [2024-11-12 06:04:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:04:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-12 06:04:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:04:59,780 INFO L225 Difference]: With dead ends: 241 [2024-11-12 06:04:59,780 INFO L226 Difference]: Without dead ends: 162 [2024-11-12 06:04:59,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:04:59,782 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:04:59,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 353 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 19.1s Time] [2024-11-12 06:04:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-12 06:04:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2024-11-12 06:04:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:04:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-12 06:04:59,808 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 172 [2024-11-12 06:04:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:04:59,809 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-12 06:04:59,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:04:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-12 06:04:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 06:04:59,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:04:59,811 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:04:59,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 06:05:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:00,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:00,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -415612251, now seen corresponding path program 1 times [2024-11-12 06:05:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:05:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121187557] [2024-11-12 06:05:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:00,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:05:00,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:05:00,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:05:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:00,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 06:05:00,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:05:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:05:06,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:05:06,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:05:06,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121187557] [2024-11-12 06:05:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121187557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:05:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:05:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:05:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296124074] [2024-11-12 06:05:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:05:06,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:05:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:05:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:05:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:05:06,669 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:11,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:15,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:19,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:23,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:05:23,687 INFO L93 Difference]: Finished difference Result 244 states and 371 transitions. [2024-11-12 06:05:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:05:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 06:05:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:05:23,749 INFO L225 Difference]: With dead ends: 244 [2024-11-12 06:05:23,749 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 06:05:23,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:05:23,758 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 96 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-12 06:05:23,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 352 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-12 06:05:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 06:05:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 132. [2024-11-12 06:05:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:05:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-11-12 06:05:23,813 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 173 [2024-11-12 06:05:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:05:23,818 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-11-12 06:05:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-11-12 06:05:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 06:05:23,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:05:23,821 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:05:23,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 06:05:24,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:24,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:24,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 7089575, now seen corresponding path program 1 times [2024-11-12 06:05:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:05:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673574926] [2024-11-12 06:05:24,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:05:24,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:05:24,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 06:05:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:24,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 06:05:24,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:05:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:05:27,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:05:27,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:05:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673574926] [2024-11-12 06:05:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673574926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:05:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:05:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:05:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961053171] [2024-11-12 06:05:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:05:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:05:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:05:27,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:05:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:05:27,118 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:31,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:05:31,363 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2024-11-12 06:05:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:05:31,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 06:05:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:05:31,369 INFO L225 Difference]: With dead ends: 210 [2024-11-12 06:05:31,369 INFO L226 Difference]: Without dead ends: 131 [2024-11-12 06:05:31,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:05:31,377 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:05:31,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 113 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 06:05:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-12 06:05:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-12 06:05:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:05:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2024-11-12 06:05:31,434 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 173 [2024-11-12 06:05:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:05:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2024-11-12 06:05:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2024-11-12 06:05:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 06:05:31,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:05:31,446 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:05:31,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 06:05:31,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:31,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:31,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1013978779, now seen corresponding path program 1 times [2024-11-12 06:05:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:05:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112142485] [2024-11-12 06:05:31,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:31,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:31,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:05:31,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:05:31,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 06:05:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:32,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 06:05:32,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:05:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:05:32,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:05:32,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:05:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112142485] [2024-11-12 06:05:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112142485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:05:32,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:05:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:05:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899024747] [2024-11-12 06:05:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:05:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:05:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:05:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:05:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:05:32,239 INFO L87 Difference]: Start difference. First operand 131 states and 193 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:36,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:40,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:05:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:05:41,027 INFO L93 Difference]: Finished difference Result 287 states and 423 transitions. [2024-11-12 06:05:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:05:41,033 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 06:05:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:05:41,036 INFO L225 Difference]: With dead ends: 287 [2024-11-12 06:05:41,040 INFO L226 Difference]: Without dead ends: 209 [2024-11-12 06:05:41,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:05:41,042 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 110 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:05:41,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 336 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-12 06:05:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-12 06:05:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2024-11-12 06:05:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:05:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-12 06:05:41,094 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 173 [2024-11-12 06:05:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:05:41,098 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-12 06:05:41,098 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 06:05:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-12 06:05:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 06:05:41,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:05:41,104 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:05:41,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 06:05:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:41,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:41,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash 444586387, now seen corresponding path program 1 times [2024-11-12 06:05:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:05:41,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895671989] [2024-11-12 06:05:41,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:05:41,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:05:41,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:05:41,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 06:05:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:41,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 06:05:41,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:05:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 629 proven. 99 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-12 06:05:46,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:05:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-12 06:05:49,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:05:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895671989] [2024-11-12 06:05:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895671989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:05:49,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:05:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-12 06:05:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974602702] [2024-11-12 06:05:49,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:05:49,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 06:05:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:05:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 06:05:49,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-12 06:05:49,946 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45)