./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-49.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_50-while_file-49.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 cfa2c23666e01bd6df2cc0afa85d53a211ba47ef59d8b9cd47dbdd9fab90400f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:14:38,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:14:38,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:14:38,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:14:38,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:14:38,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:14:38,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:14:38,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:14:38,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:14:38,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:14:38,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:14:38,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:14:38,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:14:38,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:14:38,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:14:38,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:14:38,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:14:38,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:14:38,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:14:38,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:14:38,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:14:38,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:14:38,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:14:38,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:14:38,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:14:38,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:14:38,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:14:38,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:38,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:14:38,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:14:38,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:14:38,161 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 -> cfa2c23666e01bd6df2cc0afa85d53a211ba47ef59d8b9cd47dbdd9fab90400f [2024-11-09 00:14:38,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:14:38,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:14:38,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:14:38,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:14:38,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:14:38,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:39,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:14:39,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:14:39,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:39,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5938f853/2d25b558e9844124869981bfb3a73848/FLAG7e274f516 [2024-11-09 00:14:40,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5938f853/2d25b558e9844124869981bfb3a73848 [2024-11-09 00:14:40,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:14:40,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:14:40,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:40,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:14:40,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:14:40,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ff27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40, skipping insertion in model container [2024-11-09 00:14:40,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:14:40,437 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_50-while_file-49.i[915,928] [2024-11-09 00:14:40,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:40,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:14:40,508 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_50-while_file-49.i[915,928] [2024-11-09 00:14:40,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:40,551 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:14:40,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40 WrapperNode [2024-11-09 00:14:40,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:40,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:40,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:14:40,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:14:40,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,596 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-09 00:14:40,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:40,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:14:40,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:14:40,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:14:40,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,636 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-09 00:14:40,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:14:40,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:14:40,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:14:40,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:14:40,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (1/1) ... [2024-11-09 00:14:40,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:14:40,691 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-09 00:14:40,694 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-09 00:14:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:14:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:14:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:14:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:14:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:14:40,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:14:40,793 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:14:40,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:14:41,054 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 00:14:41,054 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:14:41,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:14:41,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:14:41,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:41 BoogieIcfgContainer [2024-11-09 00:14:41,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:14:41,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:14:41,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:14:41,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:14:41,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:14:40" (1/3) ... [2024-11-09 00:14:41,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6a1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:41, skipping insertion in model container [2024-11-09 00:14:41,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:40" (2/3) ... [2024-11-09 00:14:41,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d6a1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:41, skipping insertion in model container [2024-11-09 00:14:41,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:41" (3/3) ... [2024-11-09 00:14:41,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:41,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:14:41,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:14:41,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:14:41,150 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;@3e3591ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:14:41,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:14:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:14:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:14:41,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:41,170 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:41,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:41,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 925145749, now seen corresponding path program 1 times [2024-11-09 00:14:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:14:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816459477] [2024-11-09 00:14:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:14:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:14:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:14:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:14:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:14:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:14:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:14:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:14:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:14:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:14:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:14:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:14:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:14:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:14:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:14:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:14:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:14:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:14:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:14:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:14:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:14:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:14:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:14:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816459477] [2024-11-09 00:14:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816459477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:14:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419973036] [2024-11-09 00:14:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:41,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:14:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:14:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:14:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:14:41,656 INFO L87 Difference]: Start difference. First operand has 72 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:14:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:41,680 INFO L93 Difference]: Finished difference Result 136 states and 233 transitions. [2024-11-09 00:14:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:14:41,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-09 00:14:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:41,689 INFO L225 Difference]: With dead ends: 136 [2024-11-09 00:14:41,689 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 00:14:41,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-09 00:14:41,696 INFO L432 NwaCegarLoop]: 100 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, 100 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-09 00:14:41,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:14:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 00:14:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 00:14:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:14:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2024-11-09 00:14:41,740 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 135 [2024-11-09 00:14:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2024-11-09 00:14:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:14:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2024-11-09 00:14:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:14:41,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:41,745 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:14:41,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:41,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 392379851, now seen corresponding path program 1 times [2024-11-09 00:14:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:14:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599484441] [2024-11-09 00:14:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:14:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:14:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:14:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:14:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:14:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:14:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:14:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:14:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:14:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:14:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:14:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:14:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:14:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:14:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:14:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:14:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:14:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:14:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:14:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:14:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:14:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:14:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:14:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599484441] [2024-11-09 00:14:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599484441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:14:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968554812] [2024-11-09 00:14:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:42,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:14:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:14:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:14:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:14:42,462 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:42,651 INFO L93 Difference]: Finished difference Result 195 states and 293 transitions. [2024-11-09 00:14:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:14:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-09 00:14:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:42,655 INFO L225 Difference]: With dead ends: 195 [2024-11-09 00:14:42,655 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 00:14:42,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-09 00:14:42,656 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:14:42,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:14:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 00:14:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2024-11-09 00:14:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:14:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2024-11-09 00:14:42,685 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 135 [2024-11-09 00:14:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:42,686 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2024-11-09 00:14:42,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2024-11-09 00:14:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 00:14:42,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:42,688 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:14:42,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1765256208, now seen corresponding path program 1 times [2024-11-09 00:14:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:14:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417457497] [2024-11-09 00:14:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:14:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:14:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:14:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:14:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:14:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:14:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:14:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:14:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:14:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:14:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:14:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:14:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:14:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:14:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:14:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:14:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:14:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:14:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:14:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:14:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:14:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:14:42,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:14:42,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417457497] [2024-11-09 00:14:42,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417457497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:42,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:42,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:14:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145436058] [2024-11-09 00:14:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:42,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:14:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:14:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:14:42,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:14:42,977 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:43,010 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2024-11-09 00:14:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:14:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-09 00:14:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:43,015 INFO L225 Difference]: With dead ends: 174 [2024-11-09 00:14:43,015 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 00:14:43,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-09 00:14:43,017 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:14:43,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:14:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 00:14:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 00:14:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 65 states have internal predecessors, (80), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:14:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-09 00:14:43,041 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 136 [2024-11-09 00:14:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:43,042 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-09 00:14:43,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-09 00:14:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:14:43,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:43,045 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:43,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:14:43,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:43,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2027081318, now seen corresponding path program 1 times [2024-11-09 00:14:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:14:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890040302] [2024-11-09 00:14:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:14:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:14:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:14:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:14:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:14:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:14:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:14:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:14:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:14:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:14:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:14:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:14:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:14:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:14:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:14:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:14:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:14:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:14:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:14:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:14:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:14:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:14:43,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:14:43,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890040302] [2024-11-09 00:14:43,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890040302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:14:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430838488] [2024-11-09 00:14:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:14:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:14:43,433 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-09 00:14:43,439 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-09 00:14:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:14:43,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:14:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-09 00:14:44,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:14:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:14:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430838488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:14:44,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:14:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-11-09 00:14:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042604568] [2024-11-09 00:14:44,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:14:44,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 00:14:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:14:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 00:14:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:14:44,881 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:14:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:45,987 INFO L93 Difference]: Finished difference Result 496 states and 713 transitions. [2024-11-09 00:14:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 00:14:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 137 [2024-11-09 00:14:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:45,992 INFO L225 Difference]: With dead ends: 496 [2024-11-09 00:14:45,994 INFO L226 Difference]: Without dead ends: 431 [2024-11-09 00:14:45,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 00:14:45,998 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 638 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:14:45,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 483 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:14:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-09 00:14:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 338. [2024-11-09 00:14:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 220 states have (on average 1.240909090909091) internal successors, (273), 221 states have internal predecessors, (273), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-09 00:14:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 487 transitions. [2024-11-09 00:14:46,049 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 487 transitions. Word has length 137 [2024-11-09 00:14:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:46,049 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 487 transitions. [2024-11-09 00:14:46,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:14:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 487 transitions. [2024-11-09 00:14:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:14:46,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:46,051 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:46,068 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-09 00:14:46,252 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-09 00:14:46,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1767230739, now seen corresponding path program 1 times [2024-11-09 00:14:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:14:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118921051] [2024-11-09 00:14:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:14:46,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942467128] [2024-11-09 00:14:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:14:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:14:46,335 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-09 00:14:46,337 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-09 00:14:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:14:46,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:14:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:14:46,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:14:46,715 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:14:46,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:14:46,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:14:46,918 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-09 00:14:46,923 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 00:14:47,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:14:47,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:14:47 BoogieIcfgContainer [2024-11-09 00:14:47,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:14:47,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:14:47,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:14:47,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:14:47,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:41" (3/4) ... [2024-11-09 00:14:47,020 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:14:47,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:14:47,022 INFO L158 Benchmark]: Toolchain (without parser) took 6766.68ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 160.9MB in the beginning and 74.2MB in the end (delta: 86.7MB). Peak memory consumption was 133.4MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,023 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:14:47,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.85ms. Allocated memory is still 192.9MB. Free memory was 160.7MB in the beginning and 148.4MB in the end (delta: 12.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.93ms. Allocated memory is still 192.9MB. Free memory was 148.4MB in the beginning and 144.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,024 INFO L158 Benchmark]: Boogie Preprocessor took 67.05ms. Allocated memory is still 192.9MB. Free memory was 144.9MB in the beginning and 138.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,024 INFO L158 Benchmark]: RCFGBuilder took 403.31ms. Allocated memory is still 192.9MB. Free memory was 138.6MB in the beginning and 116.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,025 INFO L158 Benchmark]: TraceAbstraction took 5943.81ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 115.6MB in the beginning and 75.3MB in the end (delta: 40.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,025 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 239.1MB. Free memory was 75.3MB in the beginning and 74.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:14:47,026 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.11ms. Allocated memory is still 134.2MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.85ms. Allocated memory is still 192.9MB. Free memory was 160.7MB in the beginning and 148.4MB in the end (delta: 12.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.93ms. Allocated memory is still 192.9MB. Free memory was 148.4MB in the beginning and 144.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.05ms. Allocated memory is still 192.9MB. Free memory was 144.9MB in the beginning and 138.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 403.31ms. Allocated memory is still 192.9MB. Free memory was 138.6MB in the beginning and 116.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5943.81ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 115.6MB in the beginning and 75.3MB in the end (delta: 40.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 239.1MB. Free memory was 75.3MB in the beginning and 74.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of bitwiseAnd at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L105] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L138] RET updateVariables() [L139] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L55] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=16] [L62] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L63] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L64] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L66] COND TRUE \read(last_1_var_1_12) [L67] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-2147483921, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=-3221225472, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 1053 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 676 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 377 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 115 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 3590 SizeOfPredicates, 3 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4878/5040 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-09 00:14:47,059 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_50-while_file-49.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 cfa2c23666e01bd6df2cc0afa85d53a211ba47ef59d8b9cd47dbdd9fab90400f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:14:49,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:14:49,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:14:49,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:14:49,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:14:49,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:14:49,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:14:49,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:14:49,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:14:49,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:14:49,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:14:49,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:14:49,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:14:49,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:14:49,180 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:14:49,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:14:49,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:14:49,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:14:49,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:14:49,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:14:49,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:14:49,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:14:49,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:14:49,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:14:49,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:14:49,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:14:49,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:14:49,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:14:49,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:14:49,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:49,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:14:49,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:14:49,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:14:49,188 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:14:49,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:14:49,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:14:49,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:14:49,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:14:49,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:14:49,190 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 -> cfa2c23666e01bd6df2cc0afa85d53a211ba47ef59d8b9cd47dbdd9fab90400f [2024-11-09 00:14:49,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:14:49,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:14:49,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:14:49,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:14:49,526 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:14:49,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:50,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:14:51,153 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:14:51,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:51,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ae27c0/84cb601b8d5c4f3684d5c6114cf523d0/FLAGf50687f5b [2024-11-09 00:14:51,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ae27c0/84cb601b8d5c4f3684d5c6114cf523d0 [2024-11-09 00:14:51,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:14:51,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:14:51,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:51,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:14:51,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:14:51,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102cae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51, skipping insertion in model container [2024-11-09 00:14:51,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:14:51,411 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_50-while_file-49.i[915,928] [2024-11-09 00:14:51,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:51,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:14:51,513 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_50-while_file-49.i[915,928] [2024-11-09 00:14:51,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:51,571 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:14:51,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51 WrapperNode [2024-11-09 00:14:51,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:51,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:51,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:14:51,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:14:51,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,622 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-09 00:14:51,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:51,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:14:51,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:14:51,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:14:51,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,663 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-09 00:14:51,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:14:51,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:14:51,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:14:51,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:14:51,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (1/1) ... [2024-11-09 00:14:51,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:14:51,725 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-09 00:14:51,728 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-09 00:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:14:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:14:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:14:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:14:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:14:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:14:51,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:14:51,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:14:52,245 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:14:52,246 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:14:52,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:14:52,262 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:14:52,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:52 BoogieIcfgContainer [2024-11-09 00:14:52,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:14:52,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:14:52,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:14:52,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:14:52,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:14:51" (1/3) ... [2024-11-09 00:14:52,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fd66d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:52, skipping insertion in model container [2024-11-09 00:14:52,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:51" (2/3) ... [2024-11-09 00:14:52,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fd66d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:52, skipping insertion in model container [2024-11-09 00:14:52,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:52" (3/3) ... [2024-11-09 00:14:52,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-49.i [2024-11-09 00:14:52,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:14:52,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:14:52,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:14:52,336 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;@d3fe2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:14:52,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:14:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:14:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:14:52,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:52,354 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:52,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1765893998, now seen corresponding path program 1 times [2024-11-09 00:14:52,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:14:52,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418050805] [2024-11-09 00:14:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:52,375 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-09 00:14:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:14:52,378 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-09 00:14:52,379 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-09 00:14:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:52,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:14:52,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:14:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:14:52,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:14:52,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:14:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418050805] [2024-11-09 00:14:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418050805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:52,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:14:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526480515] [2024-11-09 00:14:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:14:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:14:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:14:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:14:52,677 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:14:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:52,703 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2024-11-09 00:14:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:14:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-09 00:14:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:52,710 INFO L225 Difference]: With dead ends: 118 [2024-11-09 00:14:52,711 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 00:14:52,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-09 00:14:52,717 INFO L432 NwaCegarLoop]: 86 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, 86 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-09 00:14:52,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:14:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 00:14:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 00:14:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:14:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-09 00:14:52,760 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 132 [2024-11-09 00:14:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:52,760 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-09 00:14:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:14:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-09 00:14:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:14:52,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:52,763 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:52,771 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-09 00:14:52,967 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-09 00:14:52,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1324895972, now seen corresponding path program 1 times [2024-11-09 00:14:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:14:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896907709] [2024-11-09 00:14:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:52,970 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-09 00:14:52,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:14:52,972 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-09 00:14:52,973 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-09 00:14:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:53,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:14:53,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:14:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:14:53,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:14:53,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:14:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896907709] [2024-11-09 00:14:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896907709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:14:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187821971] [2024-11-09 00:14:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:53,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:14:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:14:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:14:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:14:53,519 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:53,821 INFO L93 Difference]: Finished difference Result 175 states and 263 transitions. [2024-11-09 00:14:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:14:53,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-09 00:14:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:53,831 INFO L225 Difference]: With dead ends: 175 [2024-11-09 00:14:53,831 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 00:14:53,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-09 00:14:53,832 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 63 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:14:53,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 242 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:14:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 00:14:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2024-11-09 00:14:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:14:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-11-09 00:14:53,856 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 132 [2024-11-09 00:14:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-11-09 00:14:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:14:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-11-09 00:14:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:14:53,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:53,861 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:53,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:14:54,061 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-09 00:14:54,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -975475145, now seen corresponding path program 1 times [2024-11-09 00:14:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:14:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632533320] [2024-11-09 00:14:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:54,064 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-09 00:14:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:14:54,066 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-09 00:14:54,067 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-09 00:14:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:54,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 00:14:54,261 INFO L278 TraceCheckSpWp]: Computing forward predicates...