./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_fillercode_fillercodestructure_filler-pe-co_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercode_fillercodestructure_filler-pe-co_file-85.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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:21:55,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:21:55,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:21:55,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:21:55,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:21:55,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:21:55,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:21:55,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:21:55,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:21:55,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:21:55,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:21:55,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:21:55,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:21:55,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:21:55,608 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:21:55,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:21:55,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:21:55,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:21:55,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:21:55,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:21:55,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:21:55,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:21:55,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:21:55,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:21:55,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:21:55,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:21:55,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:21:55,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:21:55,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:21:55,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:21:55,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:21:55,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:21:55,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:21:55,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:21:55,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:21:55,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:21:55,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:21:55,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:21:55,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:21:55,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:21:55,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:21:55,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:21:55,625 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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2024-10-24 07:21:55,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:21:55,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:21:55,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:21:55,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:21:55,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:21:55,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:21:57,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:21:57,687 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:21:57,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:21:57,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14bf86fa/2746fe9126e241ecb2fdc86953a1339a/FLAGcf0cb1212 [2024-10-24 07:21:58,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14bf86fa/2746fe9126e241ecb2fdc86953a1339a [2024-10-24 07:21:58,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:21:58,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:21:58,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:21:58,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:21:58,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:21:58,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515b0133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58, skipping insertion in model container [2024-10-24 07:21:58,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:21:58,312 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_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-10-24 07:21:58,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:21:58,421 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:21:58,438 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_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-10-24 07:21:58,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:21:58,509 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:21:58,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58 WrapperNode [2024-10-24 07:21:58,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:21:58,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:21:58,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:21:58,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:21:58,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,581 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-24 07:21:58,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:21:58,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:21:58,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:21:58,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:21:58,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,615 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-24 07:21:58,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:21:58,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:21:58,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:21:58,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:21:58,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (1/1) ... [2024-10-24 07:21:58,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:21:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:21:58,687 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-24 07:21:58,692 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-24 07:21:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:21:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:21:58,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:21:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:21:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:21:58,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:21:58,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:21:58,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:21:59,337 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 07:21:59,338 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:21:59,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:21:59,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:21:59,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:21:59 BoogieIcfgContainer [2024-10-24 07:21:59,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:21:59,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:21:59,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:21:59,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:21:59,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:21:58" (1/3) ... [2024-10-24 07:21:59,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d37ac58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:21:59, skipping insertion in model container [2024-10-24 07:21:59,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:58" (2/3) ... [2024-10-24 07:21:59,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d37ac58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:21:59, skipping insertion in model container [2024-10-24 07:21:59,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:21:59" (3/3) ... [2024-10-24 07:21:59,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:21:59,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:21:59,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:21:59,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:21:59,484 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;@70a6a100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:21:59,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:21:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:21:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 07:21:59,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:21:59,509 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:21:59,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:21:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:21:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 341439704, now seen corresponding path program 1 times [2024-10-24 07:21:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:21:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549009955] [2024-10-24 07:21:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:21:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:21:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:21:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:21:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:21:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:21:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:21:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:21:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:21:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:21:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:21:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:21:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:21:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:21:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:21:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549009955] [2024-10-24 07:22:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549009955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:22:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507321498] [2024-10-24 07:22:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:22:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:22:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:22:00,178 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:22:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:00,229 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2024-10-24 07:22:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:22:00,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-10-24 07:22:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:00,240 INFO L225 Difference]: With dead ends: 165 [2024-10-24 07:22:00,240 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 07:22:00,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-24 07:22:00,247 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:00,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:22:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 07:22:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 07:22:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 07:22:00,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 186 [2024-10-24 07:22:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:00,303 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 07:22:00,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:22:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 07:22:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 07:22:00,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:00,311 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:00,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:22:00,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:00,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1369087068, now seen corresponding path program 1 times [2024-10-24 07:22:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082262025] [2024-10-24 07:22:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082262025] [2024-10-24 07:22:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082262025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:22:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842928432] [2024-10-24 07:22:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:00,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:22:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:00,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:22:00,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:22:00,695 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:00,788 INFO L93 Difference]: Finished difference Result 234 states and 369 transitions. [2024-10-24 07:22:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:22:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 186 [2024-10-24 07:22:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:00,798 INFO L225 Difference]: With dead ends: 234 [2024-10-24 07:22:00,799 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 07:22:00,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 07:22:00,801 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 104 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:00,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 244 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:22:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 07:22:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2024-10-24 07:22:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2024-10-24 07:22:00,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 186 [2024-10-24 07:22:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:00,867 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2024-10-24 07:22:00,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2024-10-24 07:22:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 07:22:00,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:00,874 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:22:00,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2070151646, now seen corresponding path program 1 times [2024-10-24 07:22:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146654605] [2024-10-24 07:22:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146654605] [2024-10-24 07:22:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146654605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:22:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583497040] [2024-10-24 07:22:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:01,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:22:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:22:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:22:01,279 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:01,363 INFO L93 Difference]: Finished difference Result 243 states and 380 transitions. [2024-10-24 07:22:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:22:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 186 [2024-10-24 07:22:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:01,368 INFO L225 Difference]: With dead ends: 243 [2024-10-24 07:22:01,371 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 07:22:01,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 07:22:01,373 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:01,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 328 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:22:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 07:22:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2024-10-24 07:22:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-10-24 07:22:01,401 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 186 [2024-10-24 07:22:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:01,402 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-10-24 07:22:01,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-10-24 07:22:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:22:01,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:01,409 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:01,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:22:01,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 432568881, now seen corresponding path program 1 times [2024-10-24 07:22:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989512820] [2024-10-24 07:22:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989512820] [2024-10-24 07:22:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989512820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:22:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382073925] [2024-10-24 07:22:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:22:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:22:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:22:02,561 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:03,017 INFO L93 Difference]: Finished difference Result 296 states and 454 transitions. [2024-10-24 07:22:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:22:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-10-24 07:22:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:03,023 INFO L225 Difference]: With dead ends: 296 [2024-10-24 07:22:03,023 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 07:22:03,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:22:03,028 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 145 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:03,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 535 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:22:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 07:22:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 152. [2024-10-24 07:22:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:22:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2024-10-24 07:22:03,074 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 187 [2024-10-24 07:22:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2024-10-24 07:22:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2024-10-24 07:22:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:22:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:03,082 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:03,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:22:03,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -588499473, now seen corresponding path program 1 times [2024-10-24 07:22:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929308746] [2024-10-24 07:22:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:03,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929308746] [2024-10-24 07:22:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929308746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:03,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:03,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:22:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352447111] [2024-10-24 07:22:03,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:03,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:22:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:22:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:22:03,494 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:03,806 INFO L93 Difference]: Finished difference Result 364 states and 559 transitions. [2024-10-24 07:22:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:22:03,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-10-24 07:22:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:03,811 INFO L225 Difference]: With dead ends: 364 [2024-10-24 07:22:03,811 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 07:22:03,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:22:03,814 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 229 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:03,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 465 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:22:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 07:22:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 238. [2024-10-24 07:22:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-24 07:22:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 365 transitions. [2024-10-24 07:22:03,869 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 365 transitions. Word has length 187 [2024-10-24 07:22:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:03,869 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 365 transitions. [2024-10-24 07:22:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 365 transitions. [2024-10-24 07:22:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-24 07:22:03,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:03,872 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:22:03,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -252876143, now seen corresponding path program 1 times [2024-10-24 07:22:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520635596] [2024-10-24 07:22:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520635596] [2024-10-24 07:22:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520635596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:22:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695349048] [2024-10-24 07:22:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:04,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:22:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:22:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:22:04,588 INFO L87 Difference]: Start difference. First operand 238 states and 365 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:04,929 INFO L93 Difference]: Finished difference Result 348 states and 533 transitions. [2024-10-24 07:22:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:22:04,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-10-24 07:22:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:04,932 INFO L225 Difference]: With dead ends: 348 [2024-10-24 07:22:04,933 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 07:22:04,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:22:04,934 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 75 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:04,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 413 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:22:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 07:22:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2024-10-24 07:22:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:22:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2024-10-24 07:22:04,965 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 189 [2024-10-24 07:22:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2024-10-24 07:22:04,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2024-10-24 07:22:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 07:22:04,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:04,968 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:04,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:22:04,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 673135471, now seen corresponding path program 1 times [2024-10-24 07:22:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:04,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363593695] [2024-10-24 07:22:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:22:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:22:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:22:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:22:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:22:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:22:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:22:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 07:22:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:22:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:22:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:22:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:22:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 07:22:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:22:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:22:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:22:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:22:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:22:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:22:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:22:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:22:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:22:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:22:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:22:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:22:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:22:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:22:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:22:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:22:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:22:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:22:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:22:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363593695] [2024-10-24 07:22:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363593695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:22:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228930942] [2024-10-24 07:22:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:05,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:22:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:22:05,621 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-24 07:22:05,622 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-24 07:22:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:05,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 07:22:05,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:22:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 07:22:06,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:22:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:22:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228930942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:22:06,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:22:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-10-24 07:22:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328927376] [2024-10-24 07:22:06,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:22:06,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 07:22:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:22:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 07:22:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:22:06,496 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-10-24 07:22:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:07,428 INFO L93 Difference]: Finished difference Result 350 states and 508 transitions. [2024-10-24 07:22:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 07:22:07,429 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) Word has length 190 [2024-10-24 07:22:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:07,431 INFO L225 Difference]: With dead ends: 350 [2024-10-24 07:22:07,432 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 07:22:07,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 07:22:07,433 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 286 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:07,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 380 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:22:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 07:22:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 170. [2024-10-24 07:22:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 103 states have internal predecessors, (125), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:22:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2024-10-24 07:22:07,486 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 190 [2024-10-24 07:22:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:07,489 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2024-10-24 07:22:07,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-10-24 07:22:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2024-10-24 07:22:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 07:22:07,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:07,492 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:07,513 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-24 07:22:07,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:22:07,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -347873301, now seen corresponding path program 1 times [2024-10-24 07:22:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:22:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742475389] [2024-10-24 07:22:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:22:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:22:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197185823] [2024-10-24 07:22:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:07,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:22:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:22:07,841 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-24 07:22:07,843 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-24 07:22:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:22:08,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:22:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:22:08,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:22:08,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:22:08,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:22:08,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:22:08,555 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,SelfDestructingSolverStorable7 [2024-10-24 07:22:08,559 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:22:08,700 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:22:08,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:22:08 BoogieIcfgContainer [2024-10-24 07:22:08,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:22:08,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:22:08,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:22:08,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:22:08,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:21:59" (3/4) ... [2024-10-24 07:22:08,709 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:22:08,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:22:08,711 INFO L158 Benchmark]: Toolchain (without parser) took 10665.72ms. Allocated memory was 165.7MB in the beginning and 255.9MB in the end (delta: 90.2MB). Free memory was 109.7MB in the beginning and 174.4MB in the end (delta: -64.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,711 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:22:08,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.20ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 92.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.94ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 88.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,712 INFO L158 Benchmark]: Boogie Preprocessor took 66.86ms. Allocated memory is still 165.7MB. Free memory was 88.3MB in the beginning and 82.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,712 INFO L158 Benchmark]: RCFGBuilder took 731.31ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 82.9MB in the beginning and 165.5MB in the end (delta: -82.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,713 INFO L158 Benchmark]: TraceAbstraction took 9321.87ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 164.5MB in the beginning and 174.4MB in the end (delta: -9.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-10-24 07:22:08,713 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 255.9MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:22:08,714 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.18ms. Allocated memory is still 165.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.20ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 92.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.94ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 88.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.86ms. Allocated memory is still 165.7MB. Free memory was 88.3MB in the beginning and 82.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 731.31ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 82.9MB in the beginning and 165.5MB in the end (delta: -82.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9321.87ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 164.5MB in the beginning and 174.4MB in the end (delta: -9.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 255.9MB. Free memory is still 174.4MB. 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 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] float var_1_29 = 63.75; [L42] signed short int var_1_30 = -256; [L43] unsigned char var_1_31 = 0; [L44] double var_1_32 = 99999999999.2; [L45] double var_1_33 = 31.2; [L46] unsigned char var_1_35 = 1; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] unsigned char var_1_38 = 1; [L50] unsigned short int var_1_39 = 4; [L51] unsigned char var_1_40 = 4; [L52] unsigned char var_1_41 = 10; [L53] unsigned long int last_1_var_1_1 = 1000; [L54] unsigned char last_1_var_1_5 = 1; [L55] unsigned long int last_1_var_1_12 = 128; [L56] unsigned char last_1_var_1_13 = 16; [L57] unsigned long int last_1_var_1_15 = 8; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L182] last_1_var_1_1 = var_1_1 [L183] last_1_var_1_5 = var_1_5 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_13 = var_1_13 [L186] last_1_var_1_15 = var_1_15 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L136] var_1_8 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=32] [L139] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=32] [L140] var_1_9 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L141] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L142] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L142] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559] [L143] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L143] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L144] var_1_11 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L145] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L146] var_1_14 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L147] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L148] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L148] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L149] var_1_17 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L150] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L151] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L151] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L152] var_1_19 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L153] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L154] var_1_20 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L155] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L156] var_1_27 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L157] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L158] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L158] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L159] var_1_29 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L160] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L161] var_1_32 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L162] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L163] var_1_33 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L164] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L165] var_1_35 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L166] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L167] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L167] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L168] var_1_36 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L169] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L170] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L170] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L171] var_1_39 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L172] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L173] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L173] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L175] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L176] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L176] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L177] var_1_41 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L178] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L179] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L179] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L197] RET updateVariables() [L198] CALL step() [L61] signed long int stepLocal_1 = last_1_var_1_13; [L62] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L63] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L64] COND TRUE \read(last_1_var_1_5) [L65] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L74] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L75] COND TRUE last_1_var_1_13 <= stepLocal_2 [L76] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L80] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L81] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L84] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L85] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L86] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-8589934559, var_1_9=-4294967295] [L89] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L94] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L96] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L97] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L99] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L104] var_1_28 = var_1_29 [L105] var_1_30 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L106] COND FALSE !((((((var_1_32 - var_1_33)) < (var_1_29)) ? ((var_1_32 - var_1_33)) : (var_1_29))) > (var_1_7 * 31.3)) [L111] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L113] COND TRUE (var_1_7 / 25.4f) >= ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) [L114] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L116] COND TRUE ! var_1_5 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L117] EXPR (var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L117] COND TRUE (var_1_13 + var_1_13) >= ((var_1_15 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39)))) [L118] COND FALSE !(var_1_16 && (4.166 >= var_1_29)) [L121] var_1_38 = (128 - (var_1_39 + var_1_41)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L198] RET step() [L199] CALL, EXPR property() [L189-L190] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_40=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-8589934559, var_1_9=-4294967295] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 2491 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1556 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 935 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 839 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 322 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 3 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 15474/15660 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-24 07:22:08,752 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_fillercode_fillercodestructure_filler-pe-co_file-85.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 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:22:11,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:22:11,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:22:11,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:22:11,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:22:11,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:22:11,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:22:11,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:22:11,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:22:11,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:22:11,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:22:11,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:22:11,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:22:11,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:22:11,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:22:11,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:22:11,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:22:11,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:22:11,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:22:11,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:22:11,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:22:11,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:22:11,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:22:11,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:22:11,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:22:11,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:22:11,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:22:11,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:22:11,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:22:11,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:22:11,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:22:11,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:22:11,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:22:11,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:22:11,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:22:11,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:22:11,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:22:11,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:22:11,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:22:11,279 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:22:11,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:22:11,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:22:11,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:22:11,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:22:11,282 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:22:11,282 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 -> 5486e8e64b37e1d5184db58d5b3587a25bbff02506a96de751490e2d60de3bfb [2024-10-24 07:22:11,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:22:11,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:22:11,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:22:11,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:22:11,674 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:22:11,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:22:13,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:22:13,457 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:22:13,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:22:13,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf385749/15623689082046048ee00655d273b487/FLAGa18e34ade [2024-10-24 07:22:13,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf385749/15623689082046048ee00655d273b487 [2024-10-24 07:22:13,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:22:13,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:22:13,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:22:13,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:22:13,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:22:13,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:22:13" (1/1) ... [2024-10-24 07:22:13,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d32821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:13, skipping insertion in model container [2024-10-24 07:22:13,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:22:13" (1/1) ... [2024-10-24 07:22:13,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:22:14,024 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_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-10-24 07:22:14,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:22:14,143 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:22:14,159 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_fillercode_fillercodestructure_filler-pe-co_file-85.i[919,932] [2024-10-24 07:22:14,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:22:14,235 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:22:14,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14 WrapperNode [2024-10-24 07:22:14,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:22:14,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:22:14,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:22:14,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:22:14,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,302 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-24 07:22:14,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:22:14,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:22:14,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:22:14,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:22:14,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,343 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-24 07:22:14,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:22:14,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:22:14,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:22:14,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:22:14,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (1/1) ... [2024-10-24 07:22:14,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:22:14,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:22:14,418 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-24 07:22:14,425 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-24 07:22:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:22:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:22:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:22:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:22:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:22:14,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:22:14,582 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:22:14,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:22:25,650 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 07:22:25,650 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:22:25,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:22:25,706 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:22:25,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:22:25 BoogieIcfgContainer [2024-10-24 07:22:25,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:22:25,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:22:25,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:22:25,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:22:25,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:22:13" (1/3) ... [2024-10-24 07:22:25,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196312cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:22:25, skipping insertion in model container [2024-10-24 07:22:25,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:22:14" (2/3) ... [2024-10-24 07:22:25,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196312cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:22:25, skipping insertion in model container [2024-10-24 07:22:25,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:22:25" (3/3) ... [2024-10-24 07:22:25,718 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-85.i [2024-10-24 07:22:25,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:22:25,737 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:22:25,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:22:25,819 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;@607107c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:22:25,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:22:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 07:22:25,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:25,844 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:25,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:25,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1223284714, now seen corresponding path program 1 times [2024-10-24 07:22:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:22:25,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80384648] [2024-10-24 07:22:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:25,861 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-24 07:22:25,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:22:25,865 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-24 07:22:25,868 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-24 07:22:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:26,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:22:26,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:22:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2024-10-24 07:22:26,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:22:26,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:22:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80384648] [2024-10-24 07:22:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80384648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:26,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:22:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640043494] [2024-10-24 07:22:26,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:22:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:22:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:22:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:22:26,721 INFO L87 Difference]: Start difference. First operand has 82 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:22:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:27,497 INFO L93 Difference]: Finished difference Result 161 states and 292 transitions. [2024-10-24 07:22:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:22:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-10-24 07:22:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:27,530 INFO L225 Difference]: With dead ends: 161 [2024-10-24 07:22:27,531 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 07:22:27,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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-24 07:22:27,537 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:27,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:22:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 07:22:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 07:22:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-10-24 07:22:27,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 186 [2024-10-24 07:22:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-10-24 07:22:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:22:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-10-24 07:22:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-24 07:22:27,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:27,588 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:27,612 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-24 07:22:27,789 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-24 07:22:27,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:27,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2044035218, now seen corresponding path program 1 times [2024-10-24 07:22:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:22:27,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832943826] [2024-10-24 07:22:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:27,792 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-24 07:22:27,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:22:27,795 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-24 07:22:27,796 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-24 07:22:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:28,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:22:28,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:22:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:30,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:22:30,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:22:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832943826] [2024-10-24 07:22:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832943826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:22:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374434045] [2024-10-24 07:22:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:30,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:22:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:22:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:22:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:22:30,640 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:32,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:22:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:33,136 INFO L93 Difference]: Finished difference Result 159 states and 251 transitions. [2024-10-24 07:22:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:22:33,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 186 [2024-10-24 07:22:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:33,169 INFO L225 Difference]: With dead ends: 159 [2024-10-24 07:22:33,169 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 07:22:33,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:22:33,172 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 106 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:33,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 175 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 07:22:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 07:22:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 07:22:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:22:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2024-10-24 07:22:33,193 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 186 [2024-10-24 07:22:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2024-10-24 07:22:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:22:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2024-10-24 07:22:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:22:33,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:33,199 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:33,226 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-24 07:22:33,399 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-24 07:22:33,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash -914437140, now seen corresponding path program 1 times [2024-10-24 07:22:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:22:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718961539] [2024-10-24 07:22:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:33,402 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-24 07:22:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:22:33,403 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-24 07:22:33,404 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-24 07:22:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:34,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:22:34,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:22:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 07:22:39,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:22:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:22:41,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:22:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718961539] [2024-10-24 07:22:41,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718961539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:22:41,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:22:41,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-10-24 07:22:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935721694] [2024-10-24 07:22:41,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:22:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 07:22:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:22:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 07:22:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 07:22:41,787 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 07:22:48,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:22:50,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:22:54,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:22:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:22:54,847 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2024-10-24 07:22:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 07:22:54,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 187 [2024-10-24 07:22:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:22:54,854 INFO L225 Difference]: With dead ends: 304 [2024-10-24 07:22:54,854 INFO L226 Difference]: Without dead ends: 225 [2024-10-24 07:22:54,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-10-24 07:22:54,859 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:22:54,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 750 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-10-24 07:22:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-24 07:22:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2024-10-24 07:22:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 119 states have internal predecessors, (157), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-24 07:22:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 299 transitions. [2024-10-24 07:22:54,931 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 299 transitions. Word has length 187 [2024-10-24 07:22:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:22:54,932 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 299 transitions. [2024-10-24 07:22:54,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 07:22:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 299 transitions. [2024-10-24 07:22:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 07:22:54,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:22:54,937 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:22:54,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 07:22:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:22:55,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:22:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:22:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1643158751, now seen corresponding path program 1 times [2024-10-24 07:22:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:22:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785395211] [2024-10-24 07:22:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:22:55,140 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-24 07:22:55,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:22:55,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:22:55,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 07:22:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:22:55,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:22:55,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:22:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 07:22:59,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:22:59,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:22:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785395211] [2024-10-24 07:22:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785395211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:22:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:22:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:22:59,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133942197] [2024-10-24 07:22:59,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:22:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:22:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:22:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:22:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:22:59,235 INFO L87 Difference]: Start difference. First operand 194 states and 299 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:23:02,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:23:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:02,109 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2024-10-24 07:23:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:23:02,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-24 07:23:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:02,135 INFO L225 Difference]: With dead ends: 310 [2024-10-24 07:23:02,135 INFO L226 Difference]: Without dead ends: 182 [2024-10-24 07:23:02,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:23:02,138 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:02,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 466 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 07:23:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-24 07:23:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-10-24 07:23:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 105 states have internal predecessors, (132), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-24 07:23:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 274 transitions. [2024-10-24 07:23:02,183 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 274 transitions. Word has length 188 [2024-10-24 07:23:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:23:02,184 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 274 transitions. [2024-10-24 07:23:02,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:23:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 274 transitions. [2024-10-24 07:23:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-24 07:23:02,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:02,187 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:02,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 07:23:02,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:23:02,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -811811200, now seen corresponding path program 1 times [2024-10-24 07:23:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:23:02,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382800718] [2024-10-24 07:23:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:02,390 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-24 07:23:02,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:23:02,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:23:02,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 07:23:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:03,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:23:03,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:23:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 07:23:05,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:23:05,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:23:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382800718] [2024-10-24 07:23:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382800718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:23:05,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:23:05,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 07:23:05,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690241670] [2024-10-24 07:23:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:23:05,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:23:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:23:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:23:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:23:05,289 INFO L87 Difference]: Start difference. First operand 180 states and 274 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:23:08,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:23:10,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:23:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:11,241 INFO L93 Difference]: Finished difference Result 420 states and 628 transitions. [2024-10-24 07:23:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 07:23:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-10-24 07:23:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:11,249 INFO L225 Difference]: With dead ends: 420 [2024-10-24 07:23:11,249 INFO L226 Difference]: Without dead ends: 318 [2024-10-24 07:23:11,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-10-24 07:23:11,250 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 330 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:11,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 310 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 07:23:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-24 07:23:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 223. [2024-10-24 07:23:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 146 states have internal predecessors, (191), 71 states have call successors, (71), 6 states have call predecessors, (71), 6 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-24 07:23:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 333 transitions. [2024-10-24 07:23:11,302 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 333 transitions. Word has length 189 [2024-10-24 07:23:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:23:11,303 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 333 transitions. [2024-10-24 07:23:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 07:23:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 333 transitions. [2024-10-24 07:23:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-24 07:23:11,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:11,306 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:11,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 07:23:11,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:23:11,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:11,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash -811751618, now seen corresponding path program 1 times [2024-10-24 07:23:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:23:11,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738776500] [2024-10-24 07:23:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:11,508 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-24 07:23:11,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:23:11,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:23:11,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 07:23:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:12,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 07:23:12,178 INFO L278 TraceCheckSpWp]: Computing forward predicates...