./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-25.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 cbb57c0f29593d448f6879a3daeafb96125f4bb18be9c5e7e39686d9980eafd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:10:54,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:10:54,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:10:54,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:10:54,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:10:54,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:10:54,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:10:54,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:10:54,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:10:54,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:10:54,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:10:54,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:10:54,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:10:54,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:10:54,677 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:10:54,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:10:54,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:10:54,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:10:54,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:10:54,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:10:54,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:10:54,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:10:54,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:54,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:10:54,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cbb57c0f29593d448f6879a3daeafb96125f4bb18be9c5e7e39686d9980eafd0 [2025-03-08 10:10:54,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:10:54,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:10:54,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:10:54,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:10:54,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:10:54,900 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-25.i [2025-03-08 10:10:55,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd04e896/1067303f5c0147a687bc38204b29cc6d/FLAG070063d31 [2025-03-08 10:10:56,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:10:56,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-25.i [2025-03-08 10:10:56,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd04e896/1067303f5c0147a687bc38204b29cc6d/FLAG070063d31 [2025-03-08 10:10:56,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd04e896/1067303f5c0147a687bc38204b29cc6d [2025-03-08 10:10:56,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:10:56,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:10:56,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:56,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:10:56,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:10:56,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b43f260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56, skipping insertion in model container [2025-03-08 10:10:56,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:10:56,690 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-25.i[917,930] [2025-03-08 10:10:56,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:56,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:10:56,766 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-25.i[917,930] [2025-03-08 10:10:56,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:56,813 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:10:56,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56 WrapperNode [2025-03-08 10:10:56,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:56,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:56,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:10:56,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:10:56,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,862 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-03-08 10:10:56,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:56,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:10:56,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:10:56,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:10:56,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,885 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]. [2025-03-08 10:10:56,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:10:56,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:10:56,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:10:56,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:10:56,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (1/1) ... [2025-03-08 10:10:56,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:56,936 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) [2025-03-08 10:10:56,940 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 [2025-03-08 10:10:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:10:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:10:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:10:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:10:57,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:10:57,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:10:57,298 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:10:57,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:10:57,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:10:57,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:10:57,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:57 BoogieIcfgContainer [2025-03-08 10:10:57,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:10:57,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:10:57,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:10:57,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:10:57,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:10:56" (1/3) ... [2025-03-08 10:10:57,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788658c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:57, skipping insertion in model container [2025-03-08 10:10:57,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:56" (2/3) ... [2025-03-08 10:10:57,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788658c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:57, skipping insertion in model container [2025-03-08 10:10:57,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:57" (3/3) ... [2025-03-08 10:10:57,314 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-25.i [2025-03-08 10:10:57,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:10:57,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-25.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:10:57,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:10:57,374 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;@68dfe6f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:10:57,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:10:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:10:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:10:57,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:57,388 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:10:57,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2038677543, now seen corresponding path program 1 times [2025-03-08 10:10:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:10:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019199527] [2025-03-08 10:10:57,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:10:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:10:57,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:10:57,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:57,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:10:57,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:10:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019199527] [2025-03-08 10:10:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019199527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:10:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893008372] [2025-03-08 10:10:57,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:10:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:57,645 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) [2025-03-08 10:10:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:10:57,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:10:57,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:10:57,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:57,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:57,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:10:57,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:10:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:10:57,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:10:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893008372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:10:57,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:10:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:10:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251591735] [2025-03-08 10:10:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:10:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:10:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:10:57,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:10:57,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:10:57,833 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:10:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:10:57,855 INFO L93 Difference]: Finished difference Result 134 states and 228 transitions. [2025-03-08 10:10:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:10:57,857 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2025-03-08 10:10:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:10:57,863 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:10:57,863 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 10:10:57,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:10:57,870 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:10:57,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:10:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 10:10:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 10:10:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:10:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-03-08 10:10:57,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 148 [2025-03-08 10:10:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:10:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-03-08 10:10:57,915 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:10:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-03-08 10:10:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:10:57,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:57,918 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:10:57,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:10:58,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:10:58,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:58,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:58,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1762393318, now seen corresponding path program 1 times [2025-03-08 10:10:58,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:10:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126537850] [2025-03-08 10:10:58,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:10:58,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:10:58,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:10:58,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:58,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:10:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821237765] [2025-03-08 10:10:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:10:58,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:58,274 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) [2025-03-08 10:10:58,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:10:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:10:58,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:10:58,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:58,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:10:58,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:10:58,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:10:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:10:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:58,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:10:58,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:10:58,591 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:10:58,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:10:58,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:10:58,794 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,SelfDestructingSolverStorable1 [2025-03-08 10:10:58,796 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 10:10:58,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:10:58,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:10:58 BoogieIcfgContainer [2025-03-08 10:10:58,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:10:58,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:10:58,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:10:58,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:10:58,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:57" (3/4) ... [2025-03-08 10:10:58,876 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:10:58,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:10:58,878 INFO L158 Benchmark]: Toolchain (without parser) took 2302.98ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 75.7MB in the end (delta: 48.4MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-08 10:10:58,878 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:58,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:10:58,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.36ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:58,878 INFO L158 Benchmark]: Boogie Preprocessor took 43.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 103.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:58,878 INFO L158 Benchmark]: IcfgBuilder took 398.90ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 81.7MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:10:58,879 INFO L158 Benchmark]: TraceAbstraction took 1565.85ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 76.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2025-03-08 10:10:58,879 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 75.7MB in the end (delta: 940.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:58,880 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 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.36ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 103.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 398.90ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 81.7MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1565.85ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 76.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 75.7MB in the end (delta: 940.6kB). 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 133, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 5; [L25] unsigned char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] unsigned char var_1_6 = 1; [L28] double var_1_7 = 256.25; [L29] double var_1_8 = 127.8; [L30] double var_1_9 = 100.5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] float var_1_12 = 999.75; [L34] float var_1_13 = 64.5; [L35] float var_1_14 = 127.25; [L36] signed char var_1_15 = -32; [L37] float var_1_16 = 32.7; [L38] unsigned char var_1_17 = 16; [L39] unsigned char var_1_18 = 32; [L40] unsigned short int var_1_19 = 5; [L41] unsigned char var_1_20 = 0; [L42] signed long int var_1_21 = 100; [L43] signed short int var_1_22 = 50; [L44] double var_1_23 = 1000000.75; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L103] var_1_2 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L105] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=5, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L106] var_1_3 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L108] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L108] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_4=5, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L109] var_1_4 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L110] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L111] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L112] var_1_6 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5, var_1_9=201/2] [L115] var_1_7 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_8=639/5, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_8=639/5, var_1_9=201/2] [L116] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_8=639/5, var_1_9=201/2] [L117] var_1_8 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_9=201/2] [L118] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1, var_1_9=201/2] [L119] var_1_9 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L120] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L121] var_1_11 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L122] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L123] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L123] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L124] var_1_13 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L125] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L126] var_1_14 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L127] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L128] var_1_15 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L129] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L130] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L130] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L131] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L131] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L132] var_1_16 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L133] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L135] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L136] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L136] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=0, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L137] var_1_20 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L138] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L139] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L139] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_5=-256, var_1_6=1] [L152] RET updateVariables() [L153] CALL step() [L48] signed long int stepLocal_2 = 256; [L49] unsigned char stepLocal_1 = var_1_3 >= var_1_4; [L50] unsigned char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=1, stepLocal_2=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-256, var_1_6=1] [L51] COND TRUE var_1_2 && stepLocal_1 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=-256, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-256, var_1_6=1] [L52] COND TRUE stepLocal_2 != var_1_3 [L53] var_1_1 = (var_1_4 + var_1_3) VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-256, var_1_6=1] [L62] unsigned char stepLocal_3 = var_1_2; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-256, var_1_6=1] [L63] COND TRUE stepLocal_3 && var_1_6 [L64] var_1_5 = ((((var_1_4) < (-100)) ? (var_1_4) : (-100))) VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L72] var_1_10 = (var_1_6 && var_1_11) VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L73] COND TRUE ! (var_1_9 <= var_1_7) [L74] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L82] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L87] unsigned char stepLocal_5 = var_1_18; [L88] unsigned char stepLocal_4 = var_1_20 || var_1_10; VAL [isInitial=1, stepLocal_0=0, stepLocal_4=1, stepLocal_5=254, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=5, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L89] COND TRUE var_1_4 < stepLocal_5 [L90] var_1_19 = var_1_3 VAL [isInitial=1, stepLocal_0=0, stepLocal_4=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=126, var_1_1=126, var_1_20=-255, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L98] var_1_21 = var_1_4 [L99] var_1_22 = var_1_17 [L100] var_1_23 = var_1_14 VAL [isInitial=1, stepLocal_0=0, stepLocal_4=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=126, var_1_1=126, var_1_20=-255, var_1_21=0, var_1_22=16, var_1_23=3, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L153] RET step() [L154] CALL, EXPR property() [L144-L145] return (((((((((var_1_2 && (var_1_3 >= var_1_4)) ? ((256 != var_1_3) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_3))) : 1) : ((var_1_4 >= var_1_3) ? (var_1_1 == ((signed long int) var_1_3)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_2 && var_1_6) ? (var_1_5 == ((signed short int) ((((var_1_4) < (-100)) ? (var_1_4) : (-100))))) : (((var_1_7 - var_1_8) > var_1_9) ? (var_1_5 == ((signed short int) var_1_3)) : (var_1_5 == ((signed short int) var_1_4))))) && (var_1_10 == ((unsigned char) (var_1_6 && var_1_11)))) && ((! (var_1_9 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) / var_1_15) < var_1_4) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_2 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_4 < var_1_18) ? (var_1_19 == ((unsigned short int) var_1_3)) : (((var_1_20 || var_1_10) || var_1_6) ? (var_1_19 == ((unsigned short int) var_1_3)) : (var_1_19 == ((unsigned short int) var_1_4))))) && (var_1_21 == ((signed long int) var_1_4))) && (var_1_22 == ((signed short int) var_1_17))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=126, var_1_1=126, var_1_20=-255, var_1_21=0, var_1_22=16, var_1_23=3, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=126, var_1_1=126, var_1_20=-255, var_1_21=0, var_1_22=16, var_1_23=3, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=3, var_1_15=127, var_1_17=16, var_1_18=254, var_1_19=126, var_1_1=126, var_1_20=-255, var_1_21=0, var_1_22=16, var_1_23=3, var_1_2=1, var_1_3=382, var_1_4=0, var_1_5=-100, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 128 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 100 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1980/2024 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:10:58,896 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/21.0.5-tem/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.6.800.v20240513-1750.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-25.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 cbb57c0f29593d448f6879a3daeafb96125f4bb18be9c5e7e39686d9980eafd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:11:00,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:11:00,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:11:00,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:11:00,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:11:00,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:11:00,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:11:00,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:11:00,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:11:00,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:11:00,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:11:00,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:11:00,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:11:00,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:11:00,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:11:00,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:11:00,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:11:00,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:11:00,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cbb57c0f29593d448f6879a3daeafb96125f4bb18be9c5e7e39686d9980eafd0 [2025-03-08 10:11:01,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:11:01,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:11:01,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:11:01,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:11:01,014 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:11:01,015 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-25.i [2025-03-08 10:11:02,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62427da38/0d11031af47d45249019205dc8120b44/FLAG302938450 [2025-03-08 10:11:02,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:11:02,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-25.i [2025-03-08 10:11:02,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62427da38/0d11031af47d45249019205dc8120b44/FLAG302938450 [2025-03-08 10:11:02,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62427da38/0d11031af47d45249019205dc8120b44 [2025-03-08 10:11:02,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:11:02,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:11:02,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:11:02,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:11:02,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:11:02,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02, skipping insertion in model container [2025-03-08 10:11:02,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:11:02,839 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-25.i[917,930] [2025-03-08 10:11:02,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:11:02,882 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:11:02,889 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-25.i[917,930] [2025-03-08 10:11:02,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:11:02,919 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:11:02,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02 WrapperNode [2025-03-08 10:11:02,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:11:02,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:11:02,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:11:02,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:11:02,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,962 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-03-08 10:11:02,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:11:02,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:11:02,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:11:02,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:11:02,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,986 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]. [2025-03-08 10:11:02,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:02,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:11:03,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:11:03,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:11:03,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:11:03,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 10:11:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:11:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:11:03,037 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) [2025-03-08 10:11:03,040 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 [2025-03-08 10:11:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:11:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:11:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:11:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:11:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:11:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:11:03,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:11:03,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:11:04,453 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:11:04,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:11:04,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:11:04,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:11:04,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:04 BoogieIcfgContainer [2025-03-08 10:11:04,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:11:04,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:11:04,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:11:04,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:11:04,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:11:02" (1/3) ... [2025-03-08 10:11:04,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce42af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:04, skipping insertion in model container [2025-03-08 10:11:04,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (2/3) ... [2025-03-08 10:11:04,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce42af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:04, skipping insertion in model container [2025-03-08 10:11:04,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:04" (3/3) ... [2025-03-08 10:11:04,472 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-25.i [2025-03-08 10:11:04,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:11:04,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-25.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:11:04,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:11:04,523 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;@34c71d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:11:04,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:11:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:11:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:11:04,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:11:04,537 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:11:04,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:11:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:11:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2038677543, now seen corresponding path program 1 times [2025-03-08 10:11:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:11:04,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131583011] [2025-03-08 10:11:04,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:11:04,549 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 [2025-03-08 10:11:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:11:04,551 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) [2025-03-08 10:11:04,552 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 [2025-03-08 10:11:04,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:11:04,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:11:04,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:11:04,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:11:04,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:11:04,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:11:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-08 10:11:04,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:11:04,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:11:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131583011] [2025-03-08 10:11:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131583011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:11:04,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:11:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:11:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772786185] [2025-03-08 10:11:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:11:04,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:11:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:11:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:11:04,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:11:04,893 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:11:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:11:04,918 INFO L93 Difference]: Finished difference Result 134 states and 228 transitions. [2025-03-08 10:11:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:11:04,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2025-03-08 10:11:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:11:04,925 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:11:04,926 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 10:11:04,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:11:04,932 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:11:04,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:11:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 10:11:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 10:11:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:11:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-03-08 10:11:04,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 148 [2025-03-08 10:11:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:11:04,969 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-03-08 10:11:04,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:11:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-03-08 10:11:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:11:04,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:11:04,977 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:11:04,987 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 [2025-03-08 10:11:05,178 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 [2025-03-08 10:11:05,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:11:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:11:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1762393318, now seen corresponding path program 1 times [2025-03-08 10:11:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:11:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732328602] [2025-03-08 10:11:05,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:11:05,180 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 [2025-03-08 10:11:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:11:05,182 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) [2025-03-08 10:11:05,183 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 [2025-03-08 10:11:05,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:11:05,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:11:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:11:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:11:05,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 10:11:05,447 INFO L279 TraceCheckSpWp]: Computing forward predicates...