./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.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_codestructure_steplocals_file-67.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 f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:49:22,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:49:22,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:49:22,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:49:22,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:49:22,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:49:22,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:49:22,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:49:22,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:49:22,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:49:22,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:49:22,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:49:22,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:49:22,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:49:22,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:49:22,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:49:22,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:49:22,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:49:22,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:49:22,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:49:22,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:49:22,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:49:22,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:49:22,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:49:22,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:49:22,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:49:22,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:49:22,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:49:22,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:49:22,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:49:22,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:49:22,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:49:22,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:49:22,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:49:22,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:49:22,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:49:22,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:49:22,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:49:22,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:49:22,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:49:22,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:49:22,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:49:22,805 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 -> f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b [2024-11-08 19:49:23,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:49:23,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:49:23,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:49:23,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:49:23,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:49:23,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:24,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:49:24,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:49:24,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:24,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c69c62a1/6970725477034100903921a373ffbf64/FLAGe08c6be69 [2024-11-08 19:49:24,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c69c62a1/6970725477034100903921a373ffbf64 [2024-11-08 19:49:24,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:49:24,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:49:24,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:49:24,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:49:24,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:49:24,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:49:24" (1/1) ... [2024-11-08 19:49:24,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750d96e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:24, skipping insertion in model container [2024-11-08 19:49:24,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:49:24" (1/1) ... [2024-11-08 19:49:24,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:49:24,953 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_codestructure_steplocals_file-67.i[917,930] [2024-11-08 19:49:25,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:49:25,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:49:25,032 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_codestructure_steplocals_file-67.i[917,930] [2024-11-08 19:49:25,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:49:25,076 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:49:25,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25 WrapperNode [2024-11-08 19:49:25,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:49:25,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:49:25,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:49:25,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:49:25,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,134 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-08 19:49:25,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:49:25,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:49:25,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:49:25,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:49:25,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:49:25,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:49:25,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:49:25,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:49:25,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:49:25,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (1/1) ... [2024-11-08 19:49:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:49:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:49:25,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:49:25,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:49:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:49:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:49:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:49:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:49:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:49:25,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:49:25,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:49:25,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:49:25,792 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 19:49:25,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:49:25,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:49:25,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:49:25,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:25 BoogieIcfgContainer [2024-11-08 19:49:25,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:49:25,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:49:25,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:49:25,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:49:25,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:49:24" (1/3) ... [2024-11-08 19:49:25,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487d2c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:25, skipping insertion in model container [2024-11-08 19:49:25,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:25" (2/3) ... [2024-11-08 19:49:25,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487d2c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:25, skipping insertion in model container [2024-11-08 19:49:25,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:25" (3/3) ... [2024-11-08 19:49:25,821 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:25,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:49:25,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:49:25,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:49:25,902 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;@55aeae21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:49:25,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:49:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:49:25,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:25,918 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:25,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:25,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -281911233, now seen corresponding path program 1 times [2024-11-08 19:49:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:49:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095833243] [2024-11-08 19:49:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:49:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:49:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:49:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:49:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:49:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:49:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:49:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:49:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:49:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:49:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:49:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:49:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:49:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:49:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:49:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:49:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:49:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:49:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:49:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:49:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:49:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:49:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:49:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:49:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:49:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:49:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:49:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:49:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:49:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 19:49:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:49:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095833243] [2024-11-08 19:49:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095833243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:49:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:49:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:49:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532738205] [2024-11-08 19:49:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:49:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:49:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:49:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:49:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:49:26,453 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:49:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:26,496 INFO L93 Difference]: Finished difference Result 169 states and 292 transitions. [2024-11-08 19:49:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:49:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-08 19:49:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:26,508 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:49:26,508 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 19:49:26,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:49:26,518 INFO L432 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:26,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:49:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 19:49:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 19:49:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-11-08 19:49:26,580 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 175 [2024-11-08 19:49:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:26,581 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-11-08 19:49:26,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:49:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-11-08 19:49:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:49:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:26,587 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:49:26,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:26,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1534459209, now seen corresponding path program 1 times [2024-11-08 19:49:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:49:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581304986] [2024-11-08 19:49:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:49:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:49:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:49:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:49:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:49:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:49:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:49:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:49:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:49:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:49:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:49:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:49:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:49:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:49:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:49:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:49:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:49:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:49:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:49:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:49:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:49:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:49:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:49:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:49:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:49:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:49:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:49:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:49:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:49:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 19:49:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:49:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581304986] [2024-11-08 19:49:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581304986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:49:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408798787] [2024-11-08 19:49:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:27,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:49:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:49:27,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:49:27,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:49:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:28,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:49:28,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-08 19:49:28,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:49:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 19:49:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408798787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:49:28,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:49:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 19:49:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660037710] [2024-11-08 19:49:28,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:49:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:49:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:49:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:49:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:49:28,831 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:49:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:29,153 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-08 19:49:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:49:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 175 [2024-11-08 19:49:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:29,157 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:49:29,157 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:49:29,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:49:29,159 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 160 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:29,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 198 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:49:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:49:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-08 19:49:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-11-08 19:49:29,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 175 [2024-11-08 19:49:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:29,178 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-11-08 19:49:29,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:49:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-11-08 19:49:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:49:29,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:29,183 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:29,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:49:29,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:49:29,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:29,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1029896831, now seen corresponding path program 1 times [2024-11-08 19:49:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:49:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117895963] [2024-11-08 19:49:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:49:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:49:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101914575] [2024-11-08 19:49:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:49:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:49:29,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:49:29,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:49:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:49:29,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:49:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:49:29,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:49:29,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:49:29,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:49:29,898 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-08 19:49:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 19:49:30,082 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:49:30,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:49:30,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:49:30 BoogieIcfgContainer [2024-11-08 19:49:30,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:49:30,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:49:30,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:49:30,212 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:49:30,212 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:25" (3/4) ... [2024-11-08 19:49:30,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:49:30,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:49:30,222 INFO L158 Benchmark]: Toolchain (without parser) took 5472.01ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 119.2MB in the beginning and 172.8MB in the end (delta: -53.6MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-08 19:49:30,223 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:49:30,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.79ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 103.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:49:30,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.35ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:49:30,224 INFO L158 Benchmark]: Boogie Preprocessor took 58.71ms. Allocated memory is still 174.1MB. Free memory was 100.3MB in the beginning and 96.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:49:30,224 INFO L158 Benchmark]: RCFGBuilder took 612.94ms. Allocated memory is still 174.1MB. Free memory was 96.5MB in the beginning and 73.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:49:30,224 INFO L158 Benchmark]: TraceAbstraction took 4400.73ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 72.7MB in the beginning and 172.8MB in the end (delta: -100.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:49:30,225 INFO L158 Benchmark]: Witness Printer took 8.89ms. Allocated memory is still 243.3MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:49:30,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.79ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 103.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.35ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.71ms. Allocated memory is still 174.1MB. Free memory was 100.3MB in the beginning and 96.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 612.94ms. Allocated memory is still 174.1MB. Free memory was 96.5MB in the beginning and 73.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4400.73ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 72.7MB in the beginning and 172.8MB in the end (delta: -100.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.89ms. Allocated memory is still 243.3MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] signed long int var_1_2 = 100; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = 10; [L27] unsigned char var_1_6 = 1; [L28] float var_1_7 = 7.5; [L29] signed long int var_1_8 = -1000; [L30] float var_1_9 = 9.25; [L31] float var_1_10 = 64.5; [L32] float var_1_11 = 16.25; [L33] signed char var_1_12 = 2; [L34] signed char var_1_13 = 8; [L35] signed char var_1_14 = 0; [L36] float var_1_15 = 0.6; [L37] signed char var_1_16 = 32; [L38] unsigned short int var_1_17 = 2; [L39] unsigned char var_1_18 = 1; [L40] unsigned short int var_1_19 = 63241; [L41] unsigned short int var_1_20 = 58697; [L42] unsigned short int var_1_21 = 25516; [L43] unsigned long int var_1_22 = 3301682525; VAL [isInitial=0, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=100, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L101] var_1_6 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L104] var_1_8 = __VERIFIER_nondet_long() [L105] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L105] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L106] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L106] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L107] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L107] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L108] var_1_9 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L109] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L110] var_1_10 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L111] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L113] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L114] var_1_13 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L115] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L116] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L116] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L117] var_1_14 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L119] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L119] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L120] var_1_18 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L121] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L122] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L122] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L123] var_1_19 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L124] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L125] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L125] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L126] var_1_20 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L127] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L128] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L128] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L130] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L132] var_1_22 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L133] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L134] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L134] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L147] RET updateVariables() [L148] CALL step() [L47] COND FALSE !(50 != var_1_2) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L50] var_1_3 = (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6) [L51] signed long int stepLocal_1 = (var_1_2 + 100) / var_1_8; [L52] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L53] COND FALSE !(stepLocal_1 >= var_1_5) VAL [isInitial=1, stepLocal_0=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151] [L60] var_1_12 = (var_1_13 - var_1_14) [L61] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, stepLocal_0=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L62] EXPR ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2 VAL [isInitial=1, stepLocal_0=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L62] signed long int stepLocal_2 = ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2; [L63] COND FALSE !(var_1_1 > (var_1_11 + var_1_7)) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L72] unsigned long int stepLocal_3 = var_1_22 - var_1_20; VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450879, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L73] COND TRUE \read(var_1_3) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450879, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L74] COND TRUE \read(var_1_6) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450879, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L75] COND TRUE \read(var_1_18) [L76] var_1_17 = var_1_14 VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450879, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L139-L140] return (((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (var_1_3 ? (var_1_6 ? (var_1_18 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((var_1_15 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32767, var_1_1=39/4, var_1_20=32768, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=151, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 213 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 489 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 696 ConstructedInterpolants, 0 QuantifiedInterpolants, 1652 SizeOfPredicates, 4 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5859/6048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:49:30,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.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 f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:49:32,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:49:32,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:49:32,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:49:32,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:49:32,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:49:32,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:49:32,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:49:32,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:49:32,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:49:32,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:49:32,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:49:32,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:49:32,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:49:32,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:49:32,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:49:32,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:49:32,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:49:32,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:49:32,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:49:32,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:49:32,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:49:32,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:49:32,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:49:32,761 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:49:32,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:49:32,761 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:49:32,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:49:32,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:49:32,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:49:32,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:49:32,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:49:32,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:49:32,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:49:32,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:49:32,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:49:32,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:49:32,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:49:32,765 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:49:32,765 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:49:32,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:49:32,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:49:32,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:49:32,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:49:32,769 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 -> f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b [2024-11-08 19:49:33,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:49:33,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:49:33,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:49:33,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:49:33,114 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:49:33,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:34,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:49:34,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:49:34,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:34,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990f4a424/44d9f448cb624d8a88a2ff030b0ecae0/FLAGf3aadfef6 [2024-11-08 19:49:34,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990f4a424/44d9f448cb624d8a88a2ff030b0ecae0 [2024-11-08 19:49:34,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:49:34,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:49:34,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:49:34,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:49:34,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:49:34,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:49:34" (1/1) ... [2024-11-08 19:49:34,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512102b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:34, skipping insertion in model container [2024-11-08 19:49:34,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:49:34" (1/1) ... [2024-11-08 19:49:34,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:49:35,073 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_codestructure_steplocals_file-67.i[917,930] [2024-11-08 19:49:35,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:49:35,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:49:35,171 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_codestructure_steplocals_file-67.i[917,930] [2024-11-08 19:49:35,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:49:35,241 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:49:35,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35 WrapperNode [2024-11-08 19:49:35,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:49:35,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:49:35,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:49:35,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:49:35,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,293 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-11-08 19:49:35,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:49:35,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:49:35,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:49:35,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:49:35,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:49:35,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:49:35,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:49:35,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:49:35,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:49:35,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (1/1) ... [2024-11-08 19:49:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:49:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:49:35,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:49:35,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:49:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:49:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:49:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:49:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:49:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:49:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:49:35,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:49:35,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:49:37,455 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:49:37,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:49:37,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:49:37,477 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:49:37,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:37 BoogieIcfgContainer [2024-11-08 19:49:37,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:49:37,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:49:37,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:49:37,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:49:37,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:49:34" (1/3) ... [2024-11-08 19:49:37,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b048cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:37, skipping insertion in model container [2024-11-08 19:49:37,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:49:35" (2/3) ... [2024-11-08 19:49:37,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b048cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:37, skipping insertion in model container [2024-11-08 19:49:37,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:37" (3/3) ... [2024-11-08 19:49:37,485 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-67.i [2024-11-08 19:49:37,500 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:49:37,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:49:37,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:49:37,571 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;@b2f04b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:49:37,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:49:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 19:49:37,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:37,591 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:37,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:37,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -529577341, now seen corresponding path program 1 times [2024-11-08 19:49:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318941000] [2024-11-08 19:49:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:37,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:49:37,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:37,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:49:37,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:49:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:37,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:49:37,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 19:49:38,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:49:38,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:49:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318941000] [2024-11-08 19:49:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318941000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:49:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:49:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:49:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913038987] [2024-11-08 19:49:38,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:49:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:49:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:49:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:49:38,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:49:38,084 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:49:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:38,113 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2024-11-08 19:49:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:49:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-11-08 19:49:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:38,122 INFO L225 Difference]: With dead ends: 145 [2024-11-08 19:49:38,122 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 19:49:38,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:49:38,129 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:38,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:49:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 19:49:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 19:49:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-11-08 19:49:38,178 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 171 [2024-11-08 19:49:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:38,178 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-11-08 19:49:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:49:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-11-08 19:49:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 19:49:38,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:38,186 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:38,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:49:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:49:38,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 841672955, now seen corresponding path program 1 times [2024-11-08 19:49:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960706142] [2024-11-08 19:49:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:38,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:49:38,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:38,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:49:38,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:49:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:38,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:49:38,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-08 19:49:39,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:49:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 19:49:40,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:49:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960706142] [2024-11-08 19:49:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960706142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:49:40,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:49:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 19:49:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479353376] [2024-11-08 19:49:40,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:49:40,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:49:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:49:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:49:40,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:49:40,215 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:49:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:41,707 INFO L93 Difference]: Finished difference Result 145 states and 218 transitions. [2024-11-08 19:49:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:49:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 171 [2024-11-08 19:49:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:41,736 INFO L225 Difference]: With dead ends: 145 [2024-11-08 19:49:41,736 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 19:49:41,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:49:41,738 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 106 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:41,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 146 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 19:49:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 19:49:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-08 19:49:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:49:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-11-08 19:49:41,756 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 171 [2024-11-08 19:49:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-11-08 19:49:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:49:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-08 19:49:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:49:41,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:41,761 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:49:41,774 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-08 19:49:41,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:49:41,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:41,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash -27387547, now seen corresponding path program 1 times [2024-11-08 19:49:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635916067] [2024-11-08 19:49:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:49:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:41,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:49:41,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:49:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:42,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:49:42,358 INFO L278 TraceCheckSpWp]: Computing forward predicates...