./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.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 f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:42:57,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:42:57,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:42:57,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:42:57,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:42:57,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:42:57,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:42:57,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:42:57,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:42:57,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:42:57,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:42:57,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:42:57,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:42:57,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:42:57,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:42:57,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:42:57,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:42:57,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:42:57,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:42:57,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:42:57,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:42:57,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:42:57,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:42:57,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:42:57,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:42:57,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:42:57,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:42:57,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:42:57,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:42:57,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:42:57,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:42:57,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:42:57,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:42:57,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:42:57,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:42:57,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:42:57,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:42:57,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:42:57,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:42:57,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:42:57,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:42:57,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:42:57,672 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 -> f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 [2024-10-13 03:42:57,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:42:57,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:42:57,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:42:57,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:42:57,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:42:57,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:42:59,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:42:59,583 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:42:59,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:42:59,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c72925d/a313546d0c284918907b1c3a53341def/FLAG64473da75 [2024-10-13 03:42:59,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c72925d/a313546d0c284918907b1c3a53341def [2024-10-13 03:42:59,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:42:59,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:42:59,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:42:59,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:42:59,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:42:59,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:42:59" (1/1) ... [2024-10-13 03:42:59,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638d4414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:59, skipping insertion in model container [2024-10-13 03:42:59,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:42:59" (1/1) ... [2024-10-13 03:42:59,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:42:59,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-10-13 03:42:59,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:42:59,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:42:59,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-10-13 03:43:00,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:00,029 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:43:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00 WrapperNode [2024-10-13 03:43:00,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:00,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:00,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:43:00,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:43:00,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,104 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-10-13 03:43:00,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:00,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:43:00,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:43:00,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:43:00,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,167 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:43:00,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:43:00,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:43:00,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:43:00,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:43:00,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (1/1) ... [2024-10-13 03:43:00,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:00,262 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-10-13 03:43:00,269 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-10-13 03:43:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:43:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:43:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:43:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:43:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:43:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:43:00,412 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:43:00,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:43:01,018 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-13 03:43:01,019 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:43:01,055 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:43:01,056 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:43:01,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:01 BoogieIcfgContainer [2024-10-13 03:43:01,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:43:01,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:43:01,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:43:01,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:43:01,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:42:59" (1/3) ... [2024-10-13 03:43:01,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3c5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:01, skipping insertion in model container [2024-10-13 03:43:01,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:00" (2/3) ... [2024-10-13 03:43:01,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3c5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:01, skipping insertion in model container [2024-10-13 03:43:01,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:01" (3/3) ... [2024-10-13 03:43:01,067 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:43:01,084 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:43:01,084 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:43:01,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:43:01,160 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;@52156578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:43:01,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:43:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:43:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 03:43:01,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:01,179 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:01,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1718681185, now seen corresponding path program 1 times [2024-10-13 03:43:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151355178] [2024-10-13 03:43:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151355178] [2024-10-13 03:43:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151355178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:43:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862751060] [2024-10-13 03:43:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:01,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:43:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:43:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:01,755 INFO L87 Difference]: Start difference. First operand has 118 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:43:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:01,816 INFO L93 Difference]: Finished difference Result 235 states and 399 transitions. [2024-10-13 03:43:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:43:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 188 [2024-10-13 03:43:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:01,826 INFO L225 Difference]: With dead ends: 235 [2024-10-13 03:43:01,826 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 03:43:01,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:01,836 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:01,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 03:43:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-13 03:43:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:43:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-10-13 03:43:01,903 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 188 [2024-10-13 03:43:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:01,904 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-10-13 03:43:01,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:43:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-10-13 03:43:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 03:43:01,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:01,908 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:01,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:43:01,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:01,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -20178913, now seen corresponding path program 1 times [2024-10-13 03:43:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:01,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932891158] [2024-10-13 03:43:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932891158] [2024-10-13 03:43:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932891158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:43:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081443401] [2024-10-13 03:43:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:43:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:02,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:43:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:02,368 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:02,446 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-10-13 03:43:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:43:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-10-13 03:43:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:02,449 INFO L225 Difference]: With dead ends: 231 [2024-10-13 03:43:02,449 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 03:43:02,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:02,453 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:02,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:43:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 03:43:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-13 03:43:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:43:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 180 transitions. [2024-10-13 03:43:02,475 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 180 transitions. Word has length 188 [2024-10-13 03:43:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 180 transitions. [2024-10-13 03:43:02,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 180 transitions. [2024-10-13 03:43:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 03:43:02,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:02,484 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:43:02,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:02,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 41860701, now seen corresponding path program 1 times [2024-10-13 03:43:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109034243] [2024-10-13 03:43:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:03,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109034243] [2024-10-13 03:43:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109034243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:43:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572188135] [2024-10-13 03:43:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:03,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:43:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:43:03,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:43:03,126 INFO L87 Difference]: Start difference. First operand 116 states and 180 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:03,441 INFO L93 Difference]: Finished difference Result 402 states and 625 transitions. [2024-10-13 03:43:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:43:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-10-13 03:43:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:03,449 INFO L225 Difference]: With dead ends: 402 [2024-10-13 03:43:03,450 INFO L226 Difference]: Without dead ends: 287 [2024-10-13 03:43:03,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-10-13 03:43:03,452 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 253 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:03,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 529 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-13 03:43:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2024-10-13 03:43:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 204 states have (on average 1.4607843137254901) internal successors, (298), 204 states have internal predecessors, (298), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 03:43:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 410 transitions. [2024-10-13 03:43:03,506 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 410 transitions. Word has length 188 [2024-10-13 03:43:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 410 transitions. [2024-10-13 03:43:03,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 410 transitions. [2024-10-13 03:43:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 03:43:03,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:03,514 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:43:03,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1841675942, now seen corresponding path program 1 times [2024-10-13 03:43:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42147798] [2024-10-13 03:43:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42147798] [2024-10-13 03:43:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42147798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:43:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495634518] [2024-10-13 03:43:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:43:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:43:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:43:04,223 INFO L87 Difference]: Start difference. First operand 263 states and 410 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:04,626 INFO L93 Difference]: Finished difference Result 867 states and 1344 transitions. [2024-10-13 03:43:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:43:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-10-13 03:43:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:04,634 INFO L225 Difference]: With dead ends: 867 [2024-10-13 03:43:04,635 INFO L226 Difference]: Without dead ends: 605 [2024-10-13 03:43:04,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10-13 03:43:04,639 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 239 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:04,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 499 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:43:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-13 03:43:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 439. [2024-10-13 03:43:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 330 states have (on average 1.4303030303030304) internal successors, (472), 332 states have internal predecessors, (472), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 03:43:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2024-10-13 03:43:04,702 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 190 [2024-10-13 03:43:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:04,703 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2024-10-13 03:43:04,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2024-10-13 03:43:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 03:43:04,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:04,706 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:04,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:43:04,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2124650778, now seen corresponding path program 1 times [2024-10-13 03:43:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134624125] [2024-10-13 03:43:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 03:43:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134624125] [2024-10-13 03:43:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134624125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707697609] [2024-10-13 03:43:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:05,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:43:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:43:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:05,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:43:05,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-10-13 03:43:05,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:43:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 03:43:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707697609] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:43:05,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:43:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 03:43:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119626905] [2024-10-13 03:43:05,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:43:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:43:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:43:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:43:05,986 INFO L87 Difference]: Start difference. First operand 439 states and 680 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-13 03:43:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:06,269 INFO L93 Difference]: Finished difference Result 901 states and 1379 transitions. [2024-10-13 03:43:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:43:06,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 190 [2024-10-13 03:43:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:06,275 INFO L225 Difference]: With dead ends: 901 [2024-10-13 03:43:06,275 INFO L226 Difference]: Without dead ends: 463 [2024-10-13 03:43:06,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:43:06,277 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 189 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:06,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 354 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-13 03:43:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 455. [2024-10-13 03:43:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 342 states have (on average 1.3888888888888888) internal successors, (475), 344 states have internal predecessors, (475), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 03:43:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 683 transitions. [2024-10-13 03:43:06,345 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 683 transitions. Word has length 190 [2024-10-13 03:43:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:06,345 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 683 transitions. [2024-10-13 03:43:06,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-13 03:43:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 683 transitions. [2024-10-13 03:43:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 03:43:06,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:06,348 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:06,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:43:06,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:06,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:06,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -810511037, now seen corresponding path program 1 times [2024-10-13 03:43:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225842039] [2024-10-13 03:43:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:43:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386263582] [2024-10-13 03:43:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:06,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:43:06,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 03:43:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:06,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 03:43:06,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1069 proven. 300 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-13 03:43:12,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:43:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225842039] [2024-10-13 03:43:20,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:43:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386263582] [2024-10-13 03:43:20,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386263582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:20,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:43:20,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2024-10-13 03:43:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907987688] [2024-10-13 03:43:20,071 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 03:43:20,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 03:43:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:20,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 03:43:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1175, Unknown=1, NotChecked=0, Total=1482 [2024-10-13 03:43:20,075 INFO L87 Difference]: Start difference. First operand 455 states and 683 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 27 states have internal predecessors, (90), 9 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2024-10-13 03:43:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:22,229 INFO L93 Difference]: Finished difference Result 1047 states and 1513 transitions. [2024-10-13 03:43:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 03:43:22,229 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 27 states have internal predecessors, (90), 9 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) Word has length 191 [2024-10-13 03:43:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:22,235 INFO L225 Difference]: With dead ends: 1047 [2024-10-13 03:43:22,235 INFO L226 Difference]: Without dead ends: 593 [2024-10-13 03:43:22,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=523, Invalid=1732, Unknown=1, NotChecked=0, Total=2256 [2024-10-13 03:43:22,238 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 639 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:22,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1685 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 03:43:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-13 03:43:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 531. [2024-10-13 03:43:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 402 states have (on average 1.3407960199004976) internal successors, (539), 404 states have internal predecessors, (539), 104 states have call successors, (104), 24 states have call predecessors, (104), 24 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 03:43:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 747 transitions. [2024-10-13 03:43:22,303 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 747 transitions. Word has length 191 [2024-10-13 03:43:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:22,304 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 747 transitions. [2024-10-13 03:43:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 27 states have internal predecessors, (90), 9 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2024-10-13 03:43:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 747 transitions. [2024-10-13 03:43:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 03:43:22,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:22,308 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:22,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:43:22,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 03:43:22,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:22,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -492451451, now seen corresponding path program 1 times [2024-10-13 03:43:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866640177] [2024-10-13 03:43:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:43:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713652225] [2024-10-13 03:43:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:22,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:22,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:43:22,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 03:43:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:22,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 03:43:22,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1089 proven. 135 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 03:43:25,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:43:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866640177] [2024-10-13 03:43:28,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:43:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713652225] [2024-10-13 03:43:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713652225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:28,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:43:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2024-10-13 03:43:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329048811] [2024-10-13 03:43:28,193 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 03:43:28,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 03:43:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:28,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 03:43:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-10-13 03:43:28,195 INFO L87 Difference]: Start difference. First operand 531 states and 747 transitions. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 23 states have internal predecessors, (81), 7 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-13 03:43:30,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 03:43:33,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 03:43:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:33,486 INFO L93 Difference]: Finished difference Result 1260 states and 1788 transitions. [2024-10-13 03:43:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-13 03:43:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 23 states have internal predecessors, (81), 7 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) Word has length 191 [2024-10-13 03:43:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:33,492 INFO L225 Difference]: With dead ends: 1260 [2024-10-13 03:43:33,492 INFO L226 Difference]: Without dead ends: 1048 [2024-10-13 03:43:33,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 03:43:33,495 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 387 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:33,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2111 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1499 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2024-10-13 03:43:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-13 03:43:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 595. [2024-10-13 03:43:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 462 states have (on average 1.367965367965368) internal successors, (632), 463 states have internal predecessors, (632), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:43:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 848 transitions. [2024-10-13 03:43:33,567 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 848 transitions. Word has length 191 [2024-10-13 03:43:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:33,570 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 848 transitions. [2024-10-13 03:43:33,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 23 states have internal predecessors, (81), 7 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-13 03:43:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 848 transitions. [2024-10-13 03:43:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 03:43:33,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:33,573 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:33,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 03:43:33,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:33,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:33,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1503568701, now seen corresponding path program 1 times [2024-10-13 03:43:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646444087] [2024-10-13 03:43:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646444087] [2024-10-13 03:43:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646444087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:33,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:43:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768890416] [2024-10-13 03:43:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:43:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:43:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:33,912 INFO L87 Difference]: Start difference. First operand 595 states and 848 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:34,033 INFO L93 Difference]: Finished difference Result 1720 states and 2448 transitions. [2024-10-13 03:43:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:43:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-10-13 03:43:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:34,040 INFO L225 Difference]: With dead ends: 1720 [2024-10-13 03:43:34,040 INFO L226 Difference]: Without dead ends: 1126 [2024-10-13 03:43:34,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:34,046 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 172 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:34,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-10-13 03:43:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 590. [2024-10-13 03:43:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 457 states have (on average 1.363238512035011) internal successors, (623), 458 states have internal predecessors, (623), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:43:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 839 transitions. [2024-10-13 03:43:34,110 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 839 transitions. Word has length 191 [2024-10-13 03:43:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:34,110 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 839 transitions. [2024-10-13 03:43:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 839 transitions. [2024-10-13 03:43:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 03:43:34,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:34,114 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:43:34,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2129463301, now seen corresponding path program 1 times [2024-10-13 03:43:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472361424] [2024-10-13 03:43:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:34,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:43:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:43:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:43:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:43:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:43:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:43:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:43:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:43:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:43:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:43:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 03:43:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 03:43:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:43:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 03:43:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:43:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 03:43:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:43:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 03:43:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 03:43:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 03:43:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472361424] [2024-10-13 03:43:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472361424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:43:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356681789] [2024-10-13 03:43:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:34,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:34,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:43:34,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 03:43:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:34,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:43:34,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-10-13 03:43:34,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:43:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 03:43:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356681789] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:43:35,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:43:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 03:43:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138909833] [2024-10-13 03:43:35,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:43:35,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:43:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:35,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:43:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:43:35,034 INFO L87 Difference]: Start difference. First operand 590 states and 839 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:35,297 INFO L93 Difference]: Finished difference Result 1205 states and 1700 transitions. [2024-10-13 03:43:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:43:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 192 [2024-10-13 03:43:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:35,302 INFO L225 Difference]: With dead ends: 1205 [2024-10-13 03:43:35,302 INFO L226 Difference]: Without dead ends: 616 [2024-10-13 03:43:35,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:43:35,304 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 232 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:35,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 350 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-13 03:43:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 602. [2024-10-13 03:43:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 466 states have (on average 1.3412017167381973) internal successors, (625), 467 states have internal predecessors, (625), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 03:43:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 841 transitions. [2024-10-13 03:43:35,360 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 841 transitions. Word has length 192 [2024-10-13 03:43:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 841 transitions. [2024-10-13 03:43:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 841 transitions. [2024-10-13 03:43:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 03:43:35,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:35,364 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:35,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 03:43:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:35,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1320116675, now seen corresponding path program 1 times [2024-10-13 03:43:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375106072] [2024-10-13 03:43:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:43:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999895133] [2024-10-13 03:43:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:35,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:43:35,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:35,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:43:35,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 03:43:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:43:35,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:43:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:43:36,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:43:36,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:43:36,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:43:36,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 03:43:36,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 03:43:36,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:36,428 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:43:36,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:43:36 BoogieIcfgContainer [2024-10-13 03:43:36,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:43:36,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:43:36,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:43:36,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:43:36,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:01" (3/4) ... [2024-10-13 03:43:36,435 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:43:36,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:43:36,436 INFO L158 Benchmark]: Toolchain (without parser) took 36822.40ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 115.6MB in the beginning and 130.2MB in the end (delta: -14.6MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,437 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:43:36,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.64ms. Allocated memory is still 182.5MB. Free memory was 115.3MB in the beginning and 147.9MB in the end (delta: -32.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.20ms. Allocated memory is still 182.5MB. Free memory was 147.9MB in the beginning and 141.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,438 INFO L158 Benchmark]: Boogie Preprocessor took 121.78ms. Allocated memory is still 182.5MB. Free memory was 141.5MB in the beginning and 132.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,438 INFO L158 Benchmark]: RCFGBuilder took 827.83ms. Allocated memory is still 182.5MB. Free memory was 132.5MB in the beginning and 89.2MB in the end (delta: 43.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,438 INFO L158 Benchmark]: TraceAbstraction took 35371.83ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 88.5MB in the beginning and 130.2MB in the end (delta: -41.7MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2024-10-13 03:43:36,439 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 346.0MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:43:36,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.64ms. Allocated memory is still 182.5MB. Free memory was 115.3MB in the beginning and 147.9MB in the end (delta: -32.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.20ms. Allocated memory is still 182.5MB. Free memory was 147.9MB in the beginning and 141.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.78ms. Allocated memory is still 182.5MB. Free memory was 141.5MB in the beginning and 132.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 827.83ms. Allocated memory is still 182.5MB. Free memory was 132.5MB in the beginning and 89.2MB in the end (delta: 43.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35371.83ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 88.5MB in the beginning and 130.2MB in the end (delta: -41.7MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 346.0MB. Free memory is still 130.2MB. 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 200, overapproximation of bitwiseOr at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_7 = 10000; [L24] unsigned short int var_1_8 = 20453; [L25] signed short int var_1_10 = -5; [L26] unsigned char var_1_12 = 5; [L27] unsigned short int var_1_13 = 63501; [L28] unsigned char var_1_14 = 1; [L29] float var_1_15 = 16.25; [L30] float var_1_16 = 5.13; [L31] float var_1_17 = 99999999.25; [L32] signed char var_1_18 = 0; [L33] signed char var_1_19 = -4; [L34] signed char var_1_20 = 16; [L35] signed char var_1_21 = -100; [L36] float var_1_22 = 31.4; [L37] float var_1_23 = 16.432; [L38] float var_1_24 = 9999.5; [L39] unsigned long int var_1_26 = 100000000; [L40] unsigned short int var_1_27 = 50; [L41] float var_1_28 = 255.5; [L42] unsigned short int var_1_29 = 16; [L43] unsigned short int var_1_30 = 21823; [L44] float var_1_31 = 3.325; [L45] signed long int var_1_33 = 8; [L46] signed short int var_1_35 = -1; [L47] signed short int var_1_36 = 32549; [L48] unsigned char var_1_37 = 1; [L49] unsigned char var_1_38 = 0; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 128; [L52] unsigned char var_1_41 = 0; [L53] unsigned char last_1_var_1_12 = 5; [L54] unsigned long int last_1_var_1_26 = 100000000; [L55] signed short int last_1_var_1_35 = -1; [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_26 = var_1_26 [L197] last_1_var_1_35 = var_1_35 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L149] var_1_7 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L150] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L151] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L151] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L152] var_1_8 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L153] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L154] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L154] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L155] var_1_13 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L156] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L157] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L157] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L160] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L160] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L162] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L163] var_1_17 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L165] var_1_19 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L166] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L167] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L167] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L169] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L170] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L170] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L171] var_1_21 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L172] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L173] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L173] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L174] var_1_23 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L175] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L176] var_1_24 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L177] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L178] var_1_28 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L179] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L180] CALL assume_abort_if_not(var_1_28 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L180] RET assume_abort_if_not(var_1_28 != 0.0F) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L181] var_1_30 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_30 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L182] RET assume_abort_if_not(var_1_30 >= 16384) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L183] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L183] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L184] var_1_36 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_36 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L185] RET assume_abort_if_not(var_1_36 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L186] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L186] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L187] var_1_38 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L188] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L189] CALL assume_abort_if_not(var_1_38 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L189] RET assume_abort_if_not(var_1_38 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L190] var_1_39 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L191] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L192] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L192] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L209] RET updateVariables() [L210] CALL step() [L59] EXPR last_1_var_1_12 | last_1_var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L59] signed long int stepLocal_5 = last_1_var_1_12 | last_1_var_1_35; [L60] COND TRUE var_1_16 >= (var_1_17 / var_1_28) [L61] var_1_27 = (last_1_var_1_26 + var_1_14) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L67] signed long int stepLocal_2 = 4 + var_1_13; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_2=32771, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L68] COND FALSE !((16 / -5) >= stepLocal_2) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=16383] [L71] var_1_40 = var_1_14 [L72] var_1_10 = (var_1_40 - var_1_40) [L73] unsigned char stepLocal_1 = var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_1=1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L74] COND FALSE !(stepLocal_1 >= 4) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L81] COND FALSE !(var_1_8 <= var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L84] unsigned short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_4=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L85] COND TRUE stepLocal_4 >= var_1_40 [L86] var_1_26 = var_1_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L88] unsigned long int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_0=8191, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L89] COND FALSE !(stepLocal_0 <= 32) [L94] var_1_1 = ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L96] COND TRUE var_1_24 < var_1_16 [L97] var_1_33 = (var_1_30 + ((var_1_1 + var_1_27) - 10)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L99] unsigned short int stepLocal_10 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L100] COND FALSE !(var_1_15 > (var_1_23 / var_1_28)) [L107] var_1_41 = var_1_38 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L109] signed short int stepLocal_9 = var_1_36; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_9=16383, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L110] COND TRUE stepLocal_9 <= var_1_30 [L111] var_1_37 = ((! var_1_41) && var_1_38) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L115] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L118] COND FALSE !(\read(var_1_37)) [L121] var_1_29 = ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L123] unsigned char stepLocal_8 = var_1_37; [L124] unsigned short int stepLocal_7 = var_1_13; [L125] signed long int stepLocal_6 = - var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_6=-1, stepLocal_7=32767, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L126] COND TRUE (var_1_40 / var_1_8) <= stepLocal_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_6=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L127] COND FALSE !(var_1_14 == stepLocal_6) [L132] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L137] signed long int stepLocal_3 = (var_1_7 * var_1_12) * (var_1_29 * var_1_12); VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_3=6709657650, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L138] COND FALSE !(stepLocal_3 == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L141] COND FALSE !(\read(var_1_41)) [L144] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=16383, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR ((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L200] EXPR (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L200-L201] return (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=139263, var_1_8=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2140 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2111 mSDsluCounter, 6510 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4840 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3983 IncrementalHoareTripleChecker+Invalid, 4210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 1670 mSDtfsCounter, 3983 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1729 GetRequests, 1613 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=9, InterpolantAutomatonStates: 97, 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, 9 MinimizatonAttempts, 1263 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 2857 NumberOfCodeBlocks, 2857 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2460 ConstructedInterpolants, 7 QuantifiedInterpolants, 14418 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1803 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 18978/19656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:43:36,522 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.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 f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:43:38,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:43:38,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:43:38,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:43:38,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:43:38,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:43:38,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:43:38,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:43:38,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:43:38,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:43:38,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:43:38,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:43:38,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:43:38,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:43:38,724 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:43:38,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:43:38,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:43:38,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:43:38,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:43:38,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:43:38,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:43:38,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:43:38,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:43:38,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:43:38,733 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:43:38,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:43:38,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:43:38,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:43:38,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:43:38,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:43:38,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:43:38,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:43:38,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:43:38,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:43:38,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:38,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:43:38,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:43:38,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:43:38,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:43:38,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:43:38,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:43:38,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:43:38,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:43:38,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:43:38,739 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:43:38,739 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 -> f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 [2024-10-13 03:43:39,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:43:39,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:43:39,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:43:39,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:43:39,111 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:43:39,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:43:40,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:43:40,899 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:43:40,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:43:40,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4c6285e/9f6f16ca10594e3ba49b38fa9f75199c/FLAGc6f8bd8a9 [2024-10-13 03:43:41,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4c6285e/9f6f16ca10594e3ba49b38fa9f75199c [2024-10-13 03:43:41,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:43:41,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:43:41,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:41,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:43:41,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:43:41,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6043fad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41, skipping insertion in model container [2024-10-13 03:43:41,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:43:41,499 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-10-13 03:43:41,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:41,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:43:41,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-10-13 03:43:41,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:41,738 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:43:41,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41 WrapperNode [2024-10-13 03:43:41,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:41,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:41,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:43:41,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:43:41,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,791 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-13 03:43:41,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:41,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:43:41,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:43:41,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:43:41,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,844 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:43:41,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:43:41,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:43:41,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:43:41,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:43:41,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (1/1) ... [2024-10-13 03:43:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:41,924 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-10-13 03:43:41,930 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-10-13 03:43:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:43:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:43:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:43:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:43:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:43:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:43:42,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:43:42,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:43:48,013 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-13 03:43:48,013 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:43:48,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:43:48,109 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:43:48,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:48 BoogieIcfgContainer [2024-10-13 03:43:48,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:43:48,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:43:48,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:43:48,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:43:48,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:43:41" (1/3) ... [2024-10-13 03:43:48,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d99c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:48, skipping insertion in model container [2024-10-13 03:43:48,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:41" (2/3) ... [2024-10-13 03:43:48,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d99c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:48, skipping insertion in model container [2024-10-13 03:43:48,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:48" (3/3) ... [2024-10-13 03:43:48,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-10-13 03:43:48,135 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:43:48,136 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:43:48,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:43:48,207 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;@780d51e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:43:48,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:43:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:43:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 03:43:48,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:48,230 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:48,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 996382228, now seen corresponding path program 1 times [2024-10-13 03:43:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:43:48,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224098981] [2024-10-13 03:43:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:43:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:43:48,255 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-10-13 03:43:48,256 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-10-13 03:43:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:48,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:43:48,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-13 03:43:48,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:43:48,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:43:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224098981] [2024-10-13 03:43:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224098981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:43:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195322120] [2024-10-13 03:43:48,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:43:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:43:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:43:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:48,974 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:43:53,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:43:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:53,235 INFO L93 Difference]: Finished difference Result 169 states and 297 transitions. [2024-10-13 03:43:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:43:53,238 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-10-13 03:43:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:53,244 INFO L225 Difference]: With dead ends: 169 [2024-10-13 03:43:53,244 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 03:43:53,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:53,250 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:53,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 03:43:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 03:43:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 03:43:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:43:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-10-13 03:43:53,293 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 182 [2024-10-13 03:43:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:53,293 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-10-13 03:43:53,294 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 03:43:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-10-13 03:43:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 03:43:53,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:53,298 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:43:53,323 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 (2)] Ended with exit code 0 [2024-10-13 03:43:53,500 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-10-13 03:43:53,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:53,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1070828692, now seen corresponding path program 1 times [2024-10-13 03:43:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:43:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822207595] [2024-10-13 03:43:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:43:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:43:53,509 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-10-13 03:43:53,511 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-10-13 03:43:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:54,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:43:54,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:43:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 03:43:54,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:43:54,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:43:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822207595] [2024-10-13 03:43:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822207595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:43:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026926340] [2024-10-13 03:43:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:54,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:43:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:43:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:43:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:43:54,235 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:43:58,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:44:00,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 03:44:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:44:00,735 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2024-10-13 03:44:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:44:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-10-13 03:44:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:44:00,739 INFO L225 Difference]: With dead ends: 165 [2024-10-13 03:44:00,740 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 03:44:00,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:44:00,742 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:44:00,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-10-13 03:44:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 03:44:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 03:44:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:44:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-10-13 03:44:00,755 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 182 [2024-10-13 03:44:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:44:00,757 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-10-13 03:44:00,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 03:44:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-10-13 03:44:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 03:44:00,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:44:00,761 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:44:00,784 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-10-13 03:44:00,961 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-10-13 03:44:00,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:44:00,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:44:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1289683410, now seen corresponding path program 1 times [2024-10-13 03:44:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:44:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101517333] [2024-10-13 03:44:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:44:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:44:00,967 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-10-13 03:44:00,969 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-10-13 03:44:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:01,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 03:44:01,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:44:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-10-13 03:44:06,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:44:06,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:44:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101517333] [2024-10-13 03:44:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101517333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:44:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120044105] [2024-10-13 03:44:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:44:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:44:06,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:44:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 03:44:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:07,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 03:44:07,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:44:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-10-13 03:44:09,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:44:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2120044105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:44:09,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:44:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-10-13 03:44:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159363493] [2024-10-13 03:44:09,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:44:09,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:44:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:44:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:44:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:44:09,786 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53)