./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_loopvsstraightlinecode_50-while_file-98.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 4e9e2d4b0db7be87793fcf88c3d63fe90a510e6d5e1fb275beadb3fb6f3e4b36 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:50:35,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:50:35,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:50:35,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:50:35,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:50:35,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:50:35,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:50:35,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:50:35,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:50:35,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:50:35,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:50:35,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:50:35,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:50:35,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:50:35,828 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:50:35,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:50:35,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:50:35,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:50:35,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:50:35,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:50:35,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:50:35,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:50:35,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:50:35,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:50:35,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:50:35,831 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 -> 4e9e2d4b0db7be87793fcf88c3d63fe90a510e6d5e1fb275beadb3fb6f3e4b36 [2025-03-03 23:50:36,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:50:36,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:50:36,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:50:36,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:50:36,052 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:50:36,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:37,213 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23159517e/fb7cfc1ab01f4f95ab5090c74f58f4f4/FLAGf39d3f71f [2025-03-03 23:50:37,451 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:50:37,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:37,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23159517e/fb7cfc1ab01f4f95ab5090c74f58f4f4/FLAGf39d3f71f [2025-03-03 23:50:37,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23159517e/fb7cfc1ab01f4f95ab5090c74f58f4f4 [2025-03-03 23:50:37,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:50:37,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:50:37,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:50:37,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:50:37,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:50:37,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:37" (1/1) ... [2025-03-03 23:50:37,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c66e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:37, skipping insertion in model container [2025-03-03 23:50:37,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:37" (1/1) ... [2025-03-03 23:50:37,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:50:37,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i[915,928] [2025-03-03 23:50:37,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:50:37,980 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:50:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i[915,928] [2025-03-03 23:50:38,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:50:38,021 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:50:38,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38 WrapperNode [2025-03-03 23:50:38,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:50:38,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:50:38,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:50:38,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:50:38,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,070 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-03 23:50:38,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:50:38,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:50:38,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:50:38,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:50:38,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,092 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-03 23:50:38,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:50:38,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:50:38,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:50:38,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:50:38,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (1/1) ... [2025-03-03 23:50:38,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:50:38,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:50:38,139 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-03 23:50:38,142 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-03 23:50:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:50:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:50:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:50:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:50:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:50:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:50:38,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:50:38,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:50:38,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1; [2025-03-03 23:50:38,490 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:50:38,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:50:38,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:50:38,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:50:38,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:38 BoogieIcfgContainer [2025-03-03 23:50:38,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:50:38,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:50:38,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:50:38,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:50:38,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:50:37" (1/3) ... [2025-03-03 23:50:38,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3829a773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:38, skipping insertion in model container [2025-03-03 23:50:38,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:38" (2/3) ... [2025-03-03 23:50:38,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3829a773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:38, skipping insertion in model container [2025-03-03 23:50:38,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:38" (3/3) ... [2025-03-03 23:50:38,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:38,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:50:38,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-98.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:50:38,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:50:38,585 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;@49ca83aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:50:38,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:50:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 23:50:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:50:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:38,600 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:38,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:38,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1653073215, now seen corresponding path program 1 times [2025-03-03 23:50:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:50:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602584733] [2025-03-03 23:50:38,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:50:38,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:50:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:50:38,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:38,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 23:50:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:50:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602584733] [2025-03-03 23:50:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602584733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:50:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156345740] [2025-03-03 23:50:38,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:38,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:50:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:50:38,861 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-03 23:50:38,864 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-03 23:50:38,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:50:38,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:50:38,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:38,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:50:39,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:50:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 23:50:39,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:50:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156345740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:50:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:50:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:50:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882875204] [2025-03-03 23:50:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:50:39,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:50:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:50:39,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:50:39,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:50:39,073 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 23:50:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:50:39,095 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-03-03 23:50:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:50:39,096 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, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-03-03 23:50:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:50:39,100 INFO L225 Difference]: With dead ends: 140 [2025-03-03 23:50:39,101 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:50:39,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-03 23:50:39,104 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:50:39,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:50:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:50:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 23:50:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 23:50:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 23:50:39,139 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 153 [2025-03-03 23:50:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:50:39,140 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 23:50:39,140 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, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 23:50:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 23:50:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:50:39,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:39,142 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:39,150 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-03 23:50:39,343 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-03 23:50:39,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:39,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1283932741, now seen corresponding path program 1 times [2025-03-03 23:50:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:50:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446837925] [2025-03-03 23:50:39,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:50:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:50:39,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:50:39,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:50:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684515525] [2025-03-03 23:50:39,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:50:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:50:39,648 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-03 23:50:39,649 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-03 23:50:39,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:50:39,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:50:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:50:39,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:50:39,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:50:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:50:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:50:39,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:50:39,959 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:50:39,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:50:39,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:50:40,165 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-03 23:50:40,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:50:40,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:50:40,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:50:40 BoogieIcfgContainer [2025-03-03 23:50:40,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:50:40,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:50:40,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:50:40,256 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:50:40,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:38" (3/4) ... [2025-03-03 23:50:40,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:50:40,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:50:40,262 INFO L158 Benchmark]: Toolchain (without parser) took 2468.85ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 126.4MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:50:40,262 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:50:40,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.64ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 107.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:50:40,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.96ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:50:40,263 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 99.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:50:40,263 INFO L158 Benchmark]: IcfgBuilder took 409.55ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 76.1MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:50:40,263 INFO L158 Benchmark]: TraceAbstraction took 1741.59ms. Allocated memory is still 167.8MB. Free memory was 75.7MB in the beginning and 126.4MB in the end (delta: -50.7MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-03-03 23:50:40,264 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 126.4MB in the end (delta: 36.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:50:40,264 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.14ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.64ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 107.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.96ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 99.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 409.55ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 76.1MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1741.59ms. Allocated memory is still 167.8MB. Free memory was 75.7MB in the beginning and 126.4MB in the end (delta: -50.7MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 126.4MB in the end (delta: 36.9kB). 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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] var_1_5 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L96] var_1_8 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L102] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L108] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L110] var_1_16 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L113] var_1_18 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L114] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L116] var_1_20 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L117] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L119] var_1_21 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L120] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L135] RET updateVariables() [L136] CALL step() [L46] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L47] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L49] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L50] unsigned short int stepLocal_3 = var_1_12; [L51] unsigned short int stepLocal_2 = var_1_12; [L52] unsigned short int stepLocal_1 = var_1_12; [L53] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L55] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L69] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L74] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L75] COND TRUE var_1_13 <= var_1_11 [L76] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L80] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_6=1/2, var_1_9=4] [L81] COND TRUE var_1_19 <= var_1_1 [L82] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L127-L128] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=32767, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_4=-64, var_1_5=1, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 24, 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, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 104 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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.5s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2162/2208 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-03 23:50:40,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-while_file-98.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 4e9e2d4b0db7be87793fcf88c3d63fe90a510e6d5e1fb275beadb3fb6f3e4b36 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:50:42,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:50:42,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:50:42,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:50:42,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:50:42,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:50:42,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:50:42,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:50:42,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:50:42,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:50:42,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:50:42,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:50:42,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:50:42,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:50:42,205 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:50:42,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:50:42,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:50:42,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:50:42,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:50:42,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:50:42,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:50:42,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:50:42,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:50:42,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:50:42,208 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 -> 4e9e2d4b0db7be87793fcf88c3d63fe90a510e6d5e1fb275beadb3fb6f3e4b36 [2025-03-03 23:50:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:50:42,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:50:42,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:50:42,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:50:42,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:50:42,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:43,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae2c6bc/183139fc97384fb6b40948fc74ac269d/FLAG756fcacd7 [2025-03-03 23:50:43,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:50:43,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:43,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae2c6bc/183139fc97384fb6b40948fc74ac269d/FLAG756fcacd7 [2025-03-03 23:50:43,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abae2c6bc/183139fc97384fb6b40948fc74ac269d [2025-03-03 23:50:43,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:50:43,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:50:43,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:50:43,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:50:43,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:50:43,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:43" (1/1) ... [2025-03-03 23:50:43,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d45283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:43, skipping insertion in model container [2025-03-03 23:50:43,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:43" (1/1) ... [2025-03-03 23:50:43,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:50:43,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i[915,928] [2025-03-03 23:50:44,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:50:44,061 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:50:44,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-98.i[915,928] [2025-03-03 23:50:44,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:50:44,124 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:50:44,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44 WrapperNode [2025-03-03 23:50:44,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:50:44,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:50:44,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:50:44,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:50:44,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,168 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-03 23:50:44,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:50:44,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:50:44,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:50:44,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:50:44,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,197 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-03 23:50:44,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:50:44,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:50:44,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:50:44,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:50:44,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (1/1) ... [2025-03-03 23:50:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:50:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:50:44,251 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-03 23:50:44,253 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-03 23:50:44,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:50:44,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:50:44,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:50:44,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:50:44,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:50:44,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:50:44,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:50:44,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:50:45,149 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:50:45,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:50:45,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:50:45,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:50:45,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:45 BoogieIcfgContainer [2025-03-03 23:50:45,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:50:45,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:50:45,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:50:45,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:50:45,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:50:43" (1/3) ... [2025-03-03 23:50:45,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:45, skipping insertion in model container [2025-03-03 23:50:45,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:44" (2/3) ... [2025-03-03 23:50:45,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:45, skipping insertion in model container [2025-03-03 23:50:45,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:45" (3/3) ... [2025-03-03 23:50:45,186 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-98.i [2025-03-03 23:50:45,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:50:45,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-98.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:50:45,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:50:45,253 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;@49cd12bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:50:45,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:50:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 23:50:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 23:50:45,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:45,268 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:45,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -609157204, now seen corresponding path program 1 times [2025-03-03 23:50:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:50:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184055088] [2025-03-03 23:50:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:45,281 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-03 23:50:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:50:45,283 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-03 23:50:45,284 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-03 23:50:45,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 23:50:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 23:50:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:45,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:50:45,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:50:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 23:50:45,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:50:45,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:50:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184055088] [2025-03-03 23:50:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184055088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:50:45,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:50:45,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:50:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852482973] [2025-03-03 23:50:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:50:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:50:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:50:45,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:50:45,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:50:45,600 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 23:50:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:50:45,618 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2025-03-03 23:50:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:50:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2025-03-03 23:50:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:50:45,624 INFO L225 Difference]: With dead ends: 126 [2025-03-03 23:50:45,624 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 23:50:45,626 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-03 23:50:45,628 INFO L435 NwaCegarLoop]: 95 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, 95 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-03 23:50:45,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:50:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 23:50:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 23:50:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 23:50:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 23:50:45,663 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 150 [2025-03-03 23:50:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:50:45,663 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 23:50:45,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 23:50:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 23:50:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 23:50:45,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:45,666 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:45,676 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-03 23:50:45,867 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-03 23:50:45,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 360143024, now seen corresponding path program 1 times [2025-03-03 23:50:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:50:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651531242] [2025-03-03 23:50:45,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:45,868 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-03 23:50:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:50:45,871 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-03 23:50:45,871 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-03 23:50:45,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 23:50:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 23:50:46,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:46,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:46,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:50:46,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:50:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 23:50:46,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:50:46,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:50:46,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651531242] [2025-03-03 23:50:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651531242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:50:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:50:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:50:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518218381] [2025-03-03 23:50:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:50:46,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:50:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:50:46,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:50:46,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:50:46,767 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:50:47,565 INFO L93 Difference]: Finished difference Result 181 states and 275 transitions. [2025-03-03 23:50:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:50:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 23:50:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:50:47,585 INFO L225 Difference]: With dead ends: 181 [2025-03-03 23:50:47,585 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 23:50:47,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:50:47,586 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:50:47,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:50:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 23:50:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-03 23:50:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:50:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2025-03-03 23:50:47,603 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 150 [2025-03-03 23:50:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:50:47,604 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2025-03-03 23:50:47,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2025-03-03 23:50:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 23:50:47,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:47,606 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:47,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:50:47,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:50:47,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1633321840, now seen corresponding path program 1 times [2025-03-03 23:50:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:50:47,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589180470] [2025-03-03 23:50:47,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:47,807 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-03 23:50:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:50:47,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:50:47,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:50:47,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 23:50:47,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 23:50:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:48,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:50:48,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:50:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 23:50:48,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:50:48,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:50:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589180470] [2025-03-03 23:50:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589180470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:50:48,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:50:48,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:50:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080957051] [2025-03-03 23:50:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:50:48,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:50:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:50:48,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:50:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:50:48,095 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:50:48,938 INFO L93 Difference]: Finished difference Result 280 states and 428 transitions. [2025-03-03 23:50:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:50:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 23:50:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:50:48,958 INFO L225 Difference]: With dead ends: 280 [2025-03-03 23:50:48,958 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 23:50:48,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:50:48,963 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 89 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:50:48,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 223 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:50:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 23:50:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2025-03-03 23:50:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 68 states have internal predecessors, (83), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:50:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-03 23:50:48,994 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 150 [2025-03-03 23:50:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:50:48,994 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-03 23:50:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-03 23:50:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 23:50:48,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:48,996 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:49,005 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 (4)] Ended with exit code 0 [2025-03-03 23:50:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:50:49,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1829835345, now seen corresponding path program 1 times [2025-03-03 23:50:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:50:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693844339] [2025-03-03 23:50:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:49,198 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-03 23:50:49,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:50:49,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:50:49,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 23:50:49,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 23:50:49,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 23:50:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:49,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:50:49,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:50:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 23:50:49,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:50:49,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:50:49,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693844339] [2025-03-03 23:50:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693844339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:50:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:50:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:50:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94911727] [2025-03-03 23:50:49,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:50:49,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:50:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:50:49,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:50:49,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:50:49,552 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:50:51,597 INFO L93 Difference]: Finished difference Result 342 states and 517 transitions. [2025-03-03 23:50:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:50:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-03 23:50:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:50:51,603 INFO L225 Difference]: With dead ends: 342 [2025-03-03 23:50:51,603 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 23:50:51,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:50:51,604 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 158 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:50:51,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 372 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 23:50:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 23:50:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-03-03 23:50:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 117 states have (on average 1.188034188034188) internal successors, (139), 117 states have internal predecessors, (139), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 23:50:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 331 transitions. [2025-03-03 23:50:51,659 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 331 transitions. Word has length 150 [2025-03-03 23:50:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:50:51,661 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 331 transitions. [2025-03-03 23:50:51,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 23:50:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 331 transitions. [2025-03-03 23:50:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 23:50:51,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:50:51,664 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:50:51,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:50:51,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:50:51,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:50:51,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:50:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1828911824, now seen corresponding path program 1 times [2025-03-03 23:50:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:50:51,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500605482] [2025-03-03 23:50:51,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:50:51,867 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-03 23:50:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:50:51,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:50:51,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 23:50:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 23:50:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 23:50:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:50:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:50:52,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:50:52,078 INFO L279 TraceCheckSpWp]: Computing forward predicates...