./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.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 62606ee9c3c6ad1797c432d803dd609730f326d6f279190fb6330afa114f8159 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:35:21,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:35:21,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:35:21,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:35:21,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:35:21,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:35:21,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:35:21,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:35:21,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:35:21,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:35:21,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:35:21,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:35:21,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:35:21,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:35:21,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:35:21,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:35:21,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:35:21,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:35:21,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:35:21,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:35:21,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:35:21,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:35:21,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:35:21,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:35:21,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:35:21,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:35:21,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:35:21,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:21,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:35:21,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:35:21,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:35:21,710 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 -> 62606ee9c3c6ad1797c432d803dd609730f326d6f279190fb6330afa114f8159 [2024-11-08 23:35:21,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:35:21,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:35:21,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:35:21,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:35:21,934 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:35:21,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:35:23,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:35:23,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:35:23,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:35:23,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f2cb148/3f1c56e6e9ce40e2b3191bfa08f9e042/FLAG36481e934 [2024-11-08 23:35:23,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f2cb148/3f1c56e6e9ce40e2b3191bfa08f9e042 [2024-11-08 23:35:23,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:35:23,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:35:23,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:23,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:35:23,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:35:23,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506cef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23, skipping insertion in model container [2024-11-08 23:35:23,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:35:23,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i[916,929] [2024-11-08 23:35:23,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:23,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:35:23,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i[916,929] [2024-11-08 23:35:23,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:23,702 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:35:23,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23 WrapperNode [2024-11-08 23:35:23,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:23,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:23,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:35:23,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:35:23,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,753 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-08 23:35:23,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:23,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:35:23,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:35:23,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:35:23,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:35:23,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:35:23,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:35:23,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:35:23,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:35:23,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (1/1) ... [2024-11-08 23:35:23,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:23,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:35:23,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:35:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:35:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:35:23,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:35:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:35:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:35:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:35:23,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:35:23,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:35:24,205 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:35:24,205 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:35:24,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:35:24,215 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:35:24,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:24 BoogieIcfgContainer [2024-11-08 23:35:24,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:35:24,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:35:24,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:35:24,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:35:24,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:35:23" (1/3) ... [2024-11-08 23:35:24,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9bf0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:35:24, skipping insertion in model container [2024-11-08 23:35:24,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:23" (2/3) ... [2024-11-08 23:35:24,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9bf0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:35:24, skipping insertion in model container [2024-11-08 23:35:24,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:24" (3/3) ... [2024-11-08 23:35:24,223 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:35:24,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:35:24,236 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:35:24,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:35:24,285 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;@28a39a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:35:24,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:35:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:35:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:35:24,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:24,301 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:24,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:24,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash 881063641, now seen corresponding path program 1 times [2024-11-08 23:35:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747852192] [2024-11-08 23:35:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:35:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:35:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 23:35:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 23:35:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 23:35:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:35:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 23:35:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:35:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 23:35:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:35:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:35:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:35:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:35:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:35:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:35:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:35:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:35:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:35:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:35:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:35:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 23:35:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 23:35:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:24,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747852192] [2024-11-08 23:35:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747852192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:24,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:24,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:35:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951804977] [2024-11-08 23:35:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:24,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:35:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:35:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:35:24,687 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:35:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:24,714 INFO L93 Difference]: Finished difference Result 161 states and 279 transitions. [2024-11-08 23:35:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:35:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2024-11-08 23:35:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:24,725 INFO L225 Difference]: With dead ends: 161 [2024-11-08 23:35:24,725 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 23:35:24,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:35:24,730 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:24,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:35:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 23:35:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 23:35:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:35:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2024-11-08 23:35:24,772 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2024-11-08 23:35:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:24,773 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2024-11-08 23:35:24,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:35:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2024-11-08 23:35:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:35:24,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:24,780 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:24,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:35:24,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash -784404569, now seen corresponding path program 1 times [2024-11-08 23:35:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055865119] [2024-11-08 23:35:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:35:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:35:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 23:35:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 23:35:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 23:35:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:35:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 23:35:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:35:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 23:35:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:35:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:35:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:35:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:35:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:35:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:35:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:35:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:35:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:35:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:35:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:35:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 23:35:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 23:35:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055865119] [2024-11-08 23:35:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055865119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:25,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:35:25,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481151905] [2024-11-08 23:35:25,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:25,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:35:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:35:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:35:25,148 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:25,306 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2024-11-08 23:35:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:35:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-08 23:35:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:25,309 INFO L225 Difference]: With dead ends: 234 [2024-11-08 23:35:25,309 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 23:35:25,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:35:25,310 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:25,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:35:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 23:35:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-11-08 23:35:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:35:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2024-11-08 23:35:25,337 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2024-11-08 23:35:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2024-11-08 23:35:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2024-11-08 23:35:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:35:25,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:25,340 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:25,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:35:25,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:25,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 705599288, now seen corresponding path program 1 times [2024-11-08 23:35:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96847054] [2024-11-08 23:35:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:35:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:35:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 23:35:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 23:35:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 23:35:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:35:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 23:35:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:35:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 23:35:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:35:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:35:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:35:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:35:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:25,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:35:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:35:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:35:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:35:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:35:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:35:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:35:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 23:35:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 23:35:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96847054] [2024-11-08 23:35:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96847054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:35:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276494691] [2024-11-08 23:35:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:26,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:35:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:35:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:35:26,016 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:26,186 INFO L93 Difference]: Finished difference Result 515 states and 761 transitions. [2024-11-08 23:35:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:35:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-11-08 23:35:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:26,191 INFO L225 Difference]: With dead ends: 515 [2024-11-08 23:35:26,191 INFO L226 Difference]: Without dead ends: 364 [2024-11-08 23:35:26,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:35:26,197 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 160 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:26,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 353 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:35:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-08 23:35:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 240. [2024-11-08 23:35:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 169 states have (on average 1.349112426035503) internal successors, (228), 171 states have internal predecessors, (228), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:35:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2024-11-08 23:35:26,244 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 169 [2024-11-08 23:35:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2024-11-08 23:35:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2024-11-08 23:35:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:35:26,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:26,247 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:26,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:35:26,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1069408074, now seen corresponding path program 1 times [2024-11-08 23:35:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801283776] [2024-11-08 23:35:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:35:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:35:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 23:35:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 23:35:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 23:35:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:35:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 23:35:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:35:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 23:35:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:35:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:35:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:35:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:35:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:35:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:35:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:35:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:35:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:35:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:35:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:35:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 23:35:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 23:35:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:35:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801283776] [2024-11-08 23:35:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801283776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106378665] [2024-11-08 23:35:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:26,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:26,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:35:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:26,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:35:26,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-08 23:35:27,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:35:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106378665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:35:27,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:35:27,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2024-11-08 23:35:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761670686] [2024-11-08 23:35:27,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:27,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:35:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:35:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:35:27,291 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 23:35:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:28,286 INFO L93 Difference]: Finished difference Result 1009 states and 1481 transitions. [2024-11-08 23:35:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-08 23:35:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2024-11-08 23:35:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:28,291 INFO L225 Difference]: With dead ends: 1009 [2024-11-08 23:35:28,295 INFO L226 Difference]: Without dead ends: 772 [2024-11-08 23:35:28,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 385 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=405, Invalid=1401, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 23:35:28,297 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 632 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 732 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:35:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-08 23:35:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 335. [2024-11-08 23:35:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 222 states have (on average 1.2792792792792793) internal successors, (284), 222 states have internal predecessors, (284), 100 states have call successors, (100), 12 states have call predecessors, (100), 12 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-08 23:35:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 484 transitions. [2024-11-08 23:35:28,352 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 484 transitions. Word has length 169 [2024-11-08 23:35:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 484 transitions. [2024-11-08 23:35:28,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 23:35:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 484 transitions. [2024-11-08 23:35:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:35:28,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:28,358 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:28,374 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-11-08 23:35:28,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:28,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:28,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -255257092, now seen corresponding path program 1 times [2024-11-08 23:35:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:28,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384922426] [2024-11-08 23:35:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5529964] [2024-11-08 23:35:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:28,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:28,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:28,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:35:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:28,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 23:35:28,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 746 proven. 114 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-08 23:35:30,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384922426] [2024-11-08 23:35:30,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:35:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5529964] [2024-11-08 23:35:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5529964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:30,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:35:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-08 23:35:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621414706] [2024-11-08 23:35:30,916 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:35:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:35:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-08 23:35:30,917 INFO L87 Difference]: Start difference. First operand 335 states and 484 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-08 23:35:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:32,353 INFO L93 Difference]: Finished difference Result 1030 states and 1449 transitions. [2024-11-08 23:35:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 23:35:32,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 170 [2024-11-08 23:35:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:32,357 INFO L225 Difference]: With dead ends: 1030 [2024-11-08 23:35:32,357 INFO L226 Difference]: Without dead ends: 862 [2024-11-08 23:35:32,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 23:35:32,360 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 626 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1305 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:35:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-08 23:35:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 416. [2024-11-08 23:35:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 274 states have (on average 1.27007299270073) internal successors, (348), 274 states have internal predecessors, (348), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2024-11-08 23:35:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2024-11-08 23:35:32,406 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 170 [2024-11-08 23:35:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:32,407 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2024-11-08 23:35:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-08 23:35:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2024-11-08 23:35:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:35:32,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:32,410 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:32,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:35:32,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:32,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:32,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 445807486, now seen corresponding path program 1 times [2024-11-08 23:35:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:32,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834860628] [2024-11-08 23:35:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:35:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:35:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 23:35:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 23:35:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 23:35:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:35:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 23:35:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:35:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 23:35:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:35:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:35:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:35:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:35:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:35:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:35:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:35:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:35:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:35:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:35:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:35:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 23:35:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 23:35:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:32,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:32,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834860628] [2024-11-08 23:35:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834860628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:32,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:35:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710203242] [2024-11-08 23:35:32,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:32,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:35:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:35:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:32,782 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:32,822 INFO L93 Difference]: Finished difference Result 585 states and 839 transitions. [2024-11-08 23:35:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:35:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 23:35:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:32,825 INFO L225 Difference]: With dead ends: 585 [2024-11-08 23:35:32,825 INFO L226 Difference]: Without dead ends: 418 [2024-11-08 23:35:32,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:32,826 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:32,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 234 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:35:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-08 23:35:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2024-11-08 23:35:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 274 states have (on average 1.2554744525547445) internal successors, (344), 274 states have internal predecessors, (344), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2024-11-08 23:35:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 594 transitions. [2024-11-08 23:35:32,866 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 594 transitions. Word has length 170 [2024-11-08 23:35:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:32,867 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 594 transitions. [2024-11-08 23:35:32,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 594 transitions. [2024-11-08 23:35:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:35:32,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:32,868 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:35:32,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:32,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1329199876, now seen corresponding path program 1 times [2024-11-08 23:35:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:32,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405620087] [2024-11-08 23:35:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575461389] [2024-11-08 23:35:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:32,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:32,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:35:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:33,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:35:33,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:33,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:35:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405620087] [2024-11-08 23:35:33,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:35:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575461389] [2024-11-08 23:35:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575461389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:33,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:35:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481971909] [2024-11-08 23:35:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:35:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:35:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:35:33,096 INFO L87 Difference]: Start difference. First operand 416 states and 594 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:33,359 INFO L93 Difference]: Finished difference Result 773 states and 1113 transitions. [2024-11-08 23:35:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:35:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 23:35:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:33,363 INFO L225 Difference]: With dead ends: 773 [2024-11-08 23:35:33,363 INFO L226 Difference]: Without dead ends: 605 [2024-11-08 23:35:33,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:35:33,365 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 218 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:33,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 877 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:35:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-08 23:35:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 580. [2024-11-08 23:35:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 382 states have (on average 1.2539267015706805) internal successors, (479), 382 states have internal predecessors, (479), 175 states have call successors, (175), 22 states have call predecessors, (175), 22 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-08 23:35:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 829 transitions. [2024-11-08 23:35:33,421 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 829 transitions. Word has length 170 [2024-11-08 23:35:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 829 transitions. [2024-11-08 23:35:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 829 transitions. [2024-11-08 23:35:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:35:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:33,423 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:33,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:35:33,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:33,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1091309921, now seen corresponding path program 1 times [2024-11-08 23:35:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918911175] [2024-11-08 23:35:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95037282] [2024-11-08 23:35:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:33,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:33,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:33,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 23:35:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:33,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:35:33,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-08 23:35:34,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918911175] [2024-11-08 23:35:44,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:35:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95037282] [2024-11-08 23:35:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95037282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:44,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:35:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-08 23:35:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175088214] [2024-11-08 23:35:44,305 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:44,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:35:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:35:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=259, Unknown=1, NotChecked=0, Total=306 [2024-11-08 23:35:44,307 INFO L87 Difference]: Start difference. First operand 580 states and 829 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:35:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:45,358 INFO L93 Difference]: Finished difference Result 994 states and 1412 transitions. [2024-11-08 23:35:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 23:35:45,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-08 23:35:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:45,362 INFO L225 Difference]: With dead ends: 994 [2024-11-08 23:35:45,362 INFO L226 Difference]: Without dead ends: 745 [2024-11-08 23:35:45,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=181, Invalid=810, Unknown=1, NotChecked=0, Total=992 [2024-11-08 23:35:45,363 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 312 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:45,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1093 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:35:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-08 23:35:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 598. [2024-11-08 23:35:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 400 states have (on average 1.265) internal successors, (506), 400 states have internal predecessors, (506), 175 states have call successors, (175), 22 states have call predecessors, (175), 22 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-08 23:35:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 856 transitions. [2024-11-08 23:35:45,413 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 856 transitions. Word has length 170 [2024-11-08 23:35:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 856 transitions. [2024-11-08 23:35:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:35:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 856 transitions. [2024-11-08 23:35:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:35:45,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:45,416 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:45,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 23:35:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:45,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 17367137, now seen corresponding path program 1 times [2024-11-08 23:35:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226326973] [2024-11-08 23:35:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834856542] [2024-11-08 23:35:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:45,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:45,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:45,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:45,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 23:35:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:35:45,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:35:45,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:35:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:45,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226326973] [2024-11-08 23:35:45,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:35:45,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834856542] [2024-11-08 23:35:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834856542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:45,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:45,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:35:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949904645] [2024-11-08 23:35:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:45,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:35:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:35:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:35:45,984 INFO L87 Difference]: Start difference. First operand 598 states and 856 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:46,187 INFO L93 Difference]: Finished difference Result 1106 states and 1588 transitions. [2024-11-08 23:35:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:35:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 23:35:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:46,192 INFO L225 Difference]: With dead ends: 1106 [2024-11-08 23:35:46,192 INFO L226 Difference]: Without dead ends: 610 [2024-11-08 23:35:46,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:35:46,195 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 105 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:46,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 574 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:35:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-08 23:35:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 580. [2024-11-08 23:35:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 382 states have (on average 1.2486910994764397) internal successors, (477), 382 states have internal predecessors, (477), 175 states have call successors, (175), 22 states have call predecessors, (175), 22 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-08 23:35:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 827 transitions. [2024-11-08 23:35:46,236 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 827 transitions. Word has length 170 [2024-11-08 23:35:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:46,236 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 827 transitions. [2024-11-08 23:35:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:35:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 827 transitions. [2024-11-08 23:35:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 23:35:46,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:46,238 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:46,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 23:35:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:46,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:46,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 732313654, now seen corresponding path program 1 times [2024-11-08 23:35:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:46,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258417721] [2024-11-08 23:35:46,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678671224] [2024-11-08 23:35:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:46,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:46,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:46,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:46,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 23:35:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:35:46,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:35:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:35:46,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:35:46,734 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:35:46,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:35:46,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 23:35:46,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:46,939 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:47,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:35:47,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:35:47 BoogieIcfgContainer [2024-11-08 23:35:47,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:35:47,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:35:47,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:35:47,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:35:47,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:24" (3/4) ... [2024-11-08 23:35:47,045 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:35:47,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:35:47,046 INFO L158 Benchmark]: Toolchain (without parser) took 23698.33ms. Allocated memory was 176.2MB in the beginning and 346.0MB in the end (delta: 169.9MB). Free memory was 107.1MB in the beginning and 170.7MB in the end (delta: -63.6MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:47,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.46ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 140.6MB in the end (delta: -33.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.81ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 137.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,047 INFO L158 Benchmark]: Boogie Preprocessor took 43.52ms. Allocated memory is still 176.2MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,047 INFO L158 Benchmark]: RCFGBuilder took 415.56ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 109.8MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,047 INFO L158 Benchmark]: TraceAbstraction took 22823.39ms. Allocated memory was 176.2MB in the beginning and 346.0MB in the end (delta: 169.9MB). Free memory was 109.1MB in the beginning and 170.7MB in the end (delta: -61.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-08 23:35:47,047 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 346.0MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:47,048 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.15ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.46ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 140.6MB in the end (delta: -33.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.81ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 137.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.52ms. Allocated memory is still 176.2MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 415.56ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 109.8MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22823.39ms. Allocated memory was 176.2MB in the beginning and 346.0MB in the end (delta: 169.9MB). Free memory was 109.1MB in the beginning and 170.7MB in the end (delta: -61.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 346.0MB. Free memory is still 170.7MB. 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 199, overapproximation of someBinaryArithmeticFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -8; [L23] float var_1_2 = 1.5; [L24] float var_1_3 = 24.7; [L25] float var_1_8 = 0.875; [L26] float var_1_9 = 31.875; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 0.0; [L29] float var_1_12 = 7.58; [L30] float var_1_13 = 8.6; [L31] float var_1_14 = 49.75; [L32] signed short int var_1_16 = -64; [L33] signed long int var_1_18 = 4; [L34] signed long int var_1_19 = 100; [L35] unsigned char var_1_21 = 0; [L36] unsigned char var_1_23 = 0; [L37] signed char var_1_24 = 16; [L38] signed short int var_1_26 = -1; [L39] signed char var_1_27 = -32; [L40] unsigned char var_1_28 = 1; [L41] signed long int var_1_29 = -4; [L42] signed short int var_1_31 = 1000; [L43] signed long int var_1_32 = 4; [L44] signed short int var_1_33 = 8; [L45] signed short int var_1_34 = 25; [L46] signed short int var_1_35 = 100; [L47] signed short int var_1_36 = 10000; [L48] float var_1_38 = 2.125; [L49] signed long int var_1_39 = -1000000; [L50] signed long int last_1_var_1_1 = -8; [L51] float last_1_var_1_8 = 0.875; [L52] signed short int last_1_var_1_16 = -64; [L53] signed long int last_1_var_1_18 = 4; [L54] signed long int last_1_var_1_19 = 100; [L55] signed char last_1_var_1_24 = 16; [L56] signed long int last_1_var_1_29 = -4; [L57] signed short int last_1_var_1_31 = 1000; [L58] signed long int last_1_var_1_39 = -1000000; VAL [isInitial=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L203] isInitial = 1 [L204] FCALL initially() [L205] COND TRUE 1 [L206] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_16 = var_1_16 [L191] last_1_var_1_18 = var_1_18 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_29 = var_1_29 [L195] last_1_var_1_31 = var_1_31 [L196] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L206] RET updateLastVariables() [L207] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L146] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L148] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L149] var_1_9 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L150] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L151] var_1_10 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L152] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L153] var_1_11 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L154] RET assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L155] var_1_12 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L156] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L157] var_1_13 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L158] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L159] var_1_14 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L161] var_1_23 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L162] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L164] var_1_26 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_26 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L165] RET assume_abort_if_not(var_1_26 >= -32768) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L169] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L171] var_1_32 = __VERIFIER_nondet_long() [L172] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L172] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L174] var_1_33 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L175] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L177] var_1_34 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L180] var_1_35 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L183] var_1_36 = __VERIFIER_nondet_short() [L184] CALL assume_abort_if_not(var_1_36 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L184] RET assume_abort_if_not(var_1_36 >= 8191) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] CALL assume_abort_if_not(var_1_36 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] RET assume_abort_if_not(var_1_36 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L207] RET updateVariables() [L208] CALL step() [L62] COND TRUE (var_1_2 - var_1_3) >= last_1_var_1_8 [L63] var_1_1 = ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L67] signed long int stepLocal_6 = -5; [L68] signed long int stepLocal_5 = last_1_var_1_1; [L69] signed long int stepLocal_4 = (var_1_32 - 4) * last_1_var_1_24; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_5=-8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L70] COND TRUE stepLocal_5 <= (last_1_var_1_18 * var_1_27) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L71] COND TRUE ((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == stepLocal_4 [L72] var_1_31 = ((var_1_33 + var_1_34) - var_1_35) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L83] COND TRUE ((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L84] COND TRUE last_1_var_1_29 >= (last_1_var_1_19 / var_1_26) [L85] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L90] COND FALSE !((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) [L97] var_1_16 = var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L99] COND TRUE var_1_35 <= var_1_27 [L100] var_1_38 = var_1_9 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L104] COND TRUE var_1_16 <= ((var_1_31 / -128) + var_1_1) [L105] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L107] signed long int stepLocal_0 = 64; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_0=64, stepLocal_6=-5, var_1_16=126, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L108] COND TRUE stepLocal_0 <= var_1_24 [L109] var_1_8 = (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L117] COND TRUE var_1_9 > var_1_13 [L118] var_1_18 = (var_1_24 + var_1_31) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L120] unsigned char stepLocal_2 = (var_1_31 + var_1_24) >= var_1_1; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_2=1, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=1, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L121] COND TRUE stepLocal_2 || var_1_23 [L122] var_1_28 = (var_1_21 && var_1_23) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L124] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L125] COND TRUE (last_1_var_1_39 <= var_1_31) || var_1_28 [L126] var_1_39 = var_1_36 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L129] unsigned char stepLocal_1 = var_1_21; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_1=0, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L130] COND FALSE !(var_1_28 || stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L133] signed long int stepLocal_3 = var_1_24 * (var_1_31 * var_1_16); VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_3=13113576, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L134] COND FALSE !(-50 == stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=-4, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L137] COND FALSE !(\read(var_1_23)) [L140] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=952, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L208] RET step() [L209] CALL, EXPR property() [L199-L200] return (((((((((((((var_1_2 - var_1_3) >= last_1_var_1_8) ? (var_1_1 == ((signed long int) ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16))) : (var_1_1 == ((signed long int) last_1_var_1_16))) && ((64 <= var_1_24) ? (var_1_8 == ((float) (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))))) : (var_1_21 ? (var_1_8 == ((float) (((((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) < 0 ) ? -((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) : ((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))))))) : (var_1_8 == ((float) (var_1_12 - 2.125f)))))) && (((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) ? ((var_1_13 != var_1_2) ? (var_1_16 == ((signed short int) var_1_24)) : (var_1_16 == ((signed short int) var_1_24))) : (var_1_16 == ((signed short int) var_1_24)))) && ((var_1_9 > var_1_13) ? (var_1_18 == ((signed long int) (var_1_24 + var_1_31))) : 1)) && ((var_1_28 || var_1_21) ? (var_1_19 == ((signed long int) (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))))) : 1)) && ((var_1_16 <= ((var_1_31 / -128) + var_1_1)) ? (var_1_21 == ((unsigned char) var_1_23)) : 1)) && ((((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) ? ((last_1_var_1_29 >= (last_1_var_1_19 / var_1_26)) ? (var_1_24 == ((signed char) var_1_27)) : (var_1_24 == ((signed char) var_1_27))) : 1)) && ((((var_1_31 + var_1_24) >= var_1_1) || var_1_23) ? (var_1_28 == ((unsigned char) (var_1_21 && var_1_23))) : 1)) && ((-50 == (var_1_24 * (var_1_31 * var_1_16))) ? (var_1_29 == ((signed long int) ((((-500) < (var_1_18)) ? (-500) : (var_1_18))))) : (var_1_23 ? (var_1_29 == ((signed long int) var_1_1)) : (var_1_29 == ((signed long int) var_1_1))))) && ((last_1_var_1_1 <= (last_1_var_1_18 * var_1_27)) ? ((((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == ((var_1_32 - 4) * last_1_var_1_24)) ? (var_1_31 == ((signed short int) ((var_1_33 + var_1_34) - var_1_35))) : (var_1_31 == ((signed short int) (((var_1_36 - 1) - var_1_33) + var_1_34)))) : ((-5 <= last_1_var_1_39) ? (var_1_31 == ((signed short int) var_1_27)) : (var_1_31 == ((signed short int) last_1_var_1_24))))) && ((var_1_35 <= var_1_27) ? (var_1_38 == ((float) var_1_9)) : (var_1_38 == ((float) (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))))))) && ((! var_1_21) ? (((last_1_var_1_39 <= var_1_31) || var_1_28) ? (var_1_39 == ((signed long int) var_1_36)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=952, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L209] RET, EXPR property() [L209] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=952, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=126, var_1_18=952, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=126, var_1_26=-25, var_1_27=126, var_1_28=0, var_1_29=952, var_1_31=826, var_1_32=0, var_1_33=0, var_1_34=952, var_1_35=126, var_1_36=8191, var_1_38=2, var_1_39=8191, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 10, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2187 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2173 mSDsluCounter, 5609 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4059 mSDsCounter, 649 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3594 IncrementalHoareTripleChecker+Invalid, 4243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 649 mSolverCounterUnsat, 1550 mSDtfsCounter, 3594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1435 GetRequests, 1302 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1214 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 2715 NumberOfCodeBlocks, 2715 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1851 ConstructedInterpolants, 4 QuantifiedInterpolants, 8883 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2168 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 12906/13200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:35:47,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.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 62606ee9c3c6ad1797c432d803dd609730f326d6f279190fb6330afa114f8159 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:35:48,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:35:48,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:35:48,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:35:48,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:35:49,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:35:49,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:35:49,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:35:49,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:35:49,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:35:49,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:35:49,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:35:49,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:35:49,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:35:49,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:35:49,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:35:49,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:35:49,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:35:49,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:35:49,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:35:49,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:35:49,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:35:49,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:35:49,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:35:49,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:35:49,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:35:49,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:35:49,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:35:49,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:49,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:35:49,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:35:49,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:35:49,013 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:35:49,013 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:35:49,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:35:49,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:35:49,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:35:49,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:35:49,016 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 -> 62606ee9c3c6ad1797c432d803dd609730f326d6f279190fb6330afa114f8159 [2024-11-08 23:35:49,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:35:49,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:35:49,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:35:49,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:35:49,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:35:49,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:35:50,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:35:50,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:35:50,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:35:50,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a41033d/d2c384f411e7450687a363396ed5af88/FLAG38e3f8cc7 [2024-11-08 23:35:50,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a41033d/d2c384f411e7450687a363396ed5af88 [2024-11-08 23:35:50,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:35:50,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:35:50,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:50,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:35:50,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:35:50,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:50" (1/1) ... [2024-11-08 23:35:50,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2f570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:50, skipping insertion in model container [2024-11-08 23:35:50,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:50" (1/1) ... [2024-11-08 23:35:50,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:35:50,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i[916,929] [2024-11-08 23:35:51,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:51,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:35:51,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-77.i[916,929] [2024-11-08 23:35:51,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:51,110 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:35:51,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51 WrapperNode [2024-11-08 23:35:51,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:51,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:51,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:35:51,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:35:51,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,162 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-08 23:35:51,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:51,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:35:51,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:35:51,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:35:51,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:35:51,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:35:51,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:35:51,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:35:51,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:35:51,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (1/1) ... [2024-11-08 23:35:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:51,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:35:51,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:35:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:35:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:35:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:35:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:35:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:35:51,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:35:51,382 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:35:51,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:36:01,704 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:36:01,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:36:01,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:36:01,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:36:01,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:01 BoogieIcfgContainer [2024-11-08 23:36:01,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:36:01,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:36:01,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:36:01,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:36:01,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:35:50" (1/3) ... [2024-11-08 23:36:01,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:01, skipping insertion in model container [2024-11-08 23:36:01,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:51" (2/3) ... [2024-11-08 23:36:01,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:01, skipping insertion in model container [2024-11-08 23:36:01,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:01" (3/3) ... [2024-11-08 23:36:01,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-77.i [2024-11-08 23:36:01,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:36:01,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:36:01,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:36:01,807 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;@37a477b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:36:01,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:36:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:36:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:36:01,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:01,818 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:01,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 881063641, now seen corresponding path program 1 times [2024-11-08 23:36:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181992283] [2024-11-08 23:36:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:01,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:01,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:36:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:02,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:36:02,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 23:36:02,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:36:02,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181992283] [2024-11-08 23:36:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181992283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:36:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:36:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:36:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261556800] [2024-11-08 23:36:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:36:02,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:36:02,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:36:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:36:02,366 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:36:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:02,386 INFO L93 Difference]: Finished difference Result 161 states and 279 transitions. [2024-11-08 23:36:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:36:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2024-11-08 23:36:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:02,399 INFO L225 Difference]: With dead ends: 161 [2024-11-08 23:36:02,399 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 23:36:02,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:36:02,404 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:02,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:36:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 23:36:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 23:36:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:36:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2024-11-08 23:36:02,435 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2024-11-08 23:36:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:02,435 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2024-11-08 23:36:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 23:36:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2024-11-08 23:36:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:36:02,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:02,438 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:02,453 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-11-08 23:36:02,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:02,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -784404569, now seen corresponding path program 1 times [2024-11-08 23:36:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414410627] [2024-11-08 23:36:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:02,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:02,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:36:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:03,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:36:03,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 23:36:04,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:36:04,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414410627] [2024-11-08 23:36:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414410627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:36:04,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:36:04,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:36:04,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312968851] [2024-11-08 23:36:04,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:36:04,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:36:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:36:04,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:36:04,246 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:36:09,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:13,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:17,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:20,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:20,203 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2024-11-08 23:36:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:36:20,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-08 23:36:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:20,209 INFO L225 Difference]: With dead ends: 234 [2024-11-08 23:36:20,209 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 23:36:20,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:36:20,211 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 37 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:20,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2024-11-08 23:36:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 23:36:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-11-08 23:36:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:36:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2024-11-08 23:36:20,245 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2024-11-08 23:36:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:20,246 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2024-11-08 23:36:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 23:36:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2024-11-08 23:36:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:36:20,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:20,248 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:20,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:36:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:20,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 705599288, now seen corresponding path program 1 times [2024-11-08 23:36:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442596149] [2024-11-08 23:36:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:20,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:20,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:20,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:20,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:36:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:20,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:36:20,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-08 23:36:21,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:36:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 23:36:22,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442596149] [2024-11-08 23:36:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442596149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:36:22,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:36:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 23:36:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891246668] [2024-11-08 23:36:22,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:36:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:36:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:36:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:36:22,810 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 23:36:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:31,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:35,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:35,992 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2024-11-08 23:36:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:36:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2024-11-08 23:36:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:35,996 INFO L225 Difference]: With dead ends: 321 [2024-11-08 23:36:35,996 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 23:36:35,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:36:36,001 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 169 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 87 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:36,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 205 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 156 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-11-08 23:36:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 23:36:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2024-11-08 23:36:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:36:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2024-11-08 23:36:36,019 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 169 [2024-11-08 23:36:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:36,020 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2024-11-08 23:36:36,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 23:36:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2024-11-08 23:36:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 23:36:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:36,022 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:36,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:36:36,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:36,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -255257092, now seen corresponding path program 1 times [2024-11-08 23:36:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009857471] [2024-11-08 23:36:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:36,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:36,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:36,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:36:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 23:36:36,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 767 proven. 72 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 23:36:49,314 INFO L311 TraceCheckSpWp]: Computing backward predicates...