./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:38:08,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:38:08,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:38:08,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:38:08,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:38:08,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:38:08,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:38:08,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:38:08,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:38:08,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:38:08,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:38:08,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:38:08,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:38:08,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:38:08,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:38:08,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:38:08,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:38:08,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:38:08,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:38:08,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:38:08,881 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2025-03-08 14:38:09,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:38:09,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:38:09,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:38:09,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:38:09,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:38:09,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:10,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfa69aed/0aac4563a563432389263cf35b496158/FLAGd659cce77 [2025-03-08 14:38:10,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:38:10,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:10,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfa69aed/0aac4563a563432389263cf35b496158/FLAGd659cce77 [2025-03-08 14:38:10,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfa69aed/0aac4563a563432389263cf35b496158 [2025-03-08 14:38:10,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:38:10,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:38:10,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:38:10,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:38:10,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:38:10,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:38:10" (1/1) ... [2025-03-08 14:38:10,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74958369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:10, skipping insertion in model container [2025-03-08 14:38:10,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:38:10" (1/1) ... [2025-03-08 14:38:10,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:38:10,915 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_25-while_file-92.i[915,928] [2025-03-08 14:38:10,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:38:10,966 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:38:10,975 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_25-while_file-92.i[915,928] [2025-03-08 14:38:10,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:38:11,007 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:38:11,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11 WrapperNode [2025-03-08 14:38:11,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:38:11,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:38:11,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:38:11,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:38:11,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,049 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-03-08 14:38:11,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:38:11,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:38:11,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:38:11,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:38:11,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:38:11,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:38:11,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:38:11,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:38:11,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:38:11,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (1/1) ... [2025-03-08 14:38:11,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:38:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:38:11,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:38:11,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:38:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:38:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:38:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:38:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:38:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:38:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:38:11,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:38:11,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:38:11,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-08 14:38:11,361 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 14:38:11,361 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:38:11,373 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:38:11,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:38:11,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:38:11 BoogieIcfgContainer [2025-03-08 14:38:11,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:38:11,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:38:11,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:38:11,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:38:11,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:38:10" (1/3) ... [2025-03-08 14:38:11,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4a5bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:38:11, skipping insertion in model container [2025-03-08 14:38:11,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:11" (2/3) ... [2025-03-08 14:38:11,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4a5bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:38:11, skipping insertion in model container [2025-03-08 14:38:11,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:38:11" (3/3) ... [2025-03-08 14:38:11,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:11,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:38:11,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-92.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:38:11,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:38:11,444 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;@76ca4e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:38:11,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:38:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:38:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 14:38:11,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:11,455 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:11,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -570366850, now seen corresponding path program 1 times [2025-03-08 14:38:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:38:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609997210] [2025-03-08 14:38:11,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:38:11,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 14:38:11,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 14:38:11,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:11,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:38:11,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:38:11,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609997210] [2025-03-08 14:38:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609997210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:38:11,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746975054] [2025-03-08 14:38:11,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:38:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:38:11,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:38:11,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:38:11,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 14:38:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 14:38:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:11,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:38:11,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:38:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:38:11,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:38:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746975054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:38:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:38:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:38:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795165584] [2025-03-08 14:38:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:38:11,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:38:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:38:11,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:38:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:38:11,807 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:38:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:38:11,832 INFO L93 Difference]: Finished difference Result 114 states and 188 transitions. [2025-03-08 14:38:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:38:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2025-03-08 14:38:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:38:11,839 INFO L225 Difference]: With dead ends: 114 [2025-03-08 14:38:11,839 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 14:38:11,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:38:11,845 INFO L435 NwaCegarLoop]: 81 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, 81 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-08 14:38:11,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:38:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 14:38:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 14:38:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:38:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2025-03-08 14:38:11,892 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 111 [2025-03-08 14:38:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:38:11,892 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2025-03-08 14:38:11,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:38:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2025-03-08 14:38:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 14:38:11,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:11,894 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:11,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:38:12,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:38:12,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:12,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash 270931583, now seen corresponding path program 1 times [2025-03-08 14:38:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:38:12,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287072955] [2025-03-08 14:38:12,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:38:12,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 14:38:12,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 14:38:12,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:12,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:38:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:38:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287072955] [2025-03-08 14:38:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287072955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:38:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:38:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:38:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271396192] [2025-03-08 14:38:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:38:12,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:38:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:38:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:38:12,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:38:12,281 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:38:12,326 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-03-08 14:38:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:38:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-03-08 14:38:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:38:12,329 INFO L225 Difference]: With dead ends: 153 [2025-03-08 14:38:12,329 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 14:38:12,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 14:38:12,330 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:38:12,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:38:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 14:38:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-08 14:38:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:38:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-03-08 14:38:12,344 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 111 [2025-03-08 14:38:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:38:12,344 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-03-08 14:38:12,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-03-08 14:38:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 14:38:12,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:12,346 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:38:12,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1536522880, now seen corresponding path program 1 times [2025-03-08 14:38:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:38:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53198981] [2025-03-08 14:38:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:38:12,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 14:38:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 14:38:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:38:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:38:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53198981] [2025-03-08 14:38:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53198981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:38:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:38:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:38:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340805741] [2025-03-08 14:38:12,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:38:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:38:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:38:12,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:38:12,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:38:12,669 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:38:12,824 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2025-03-08 14:38:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:38:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-03-08 14:38:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:38:12,827 INFO L225 Difference]: With dead ends: 191 [2025-03-08 14:38:12,827 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 14:38:12,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:38:12,830 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:38:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:38:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 14:38:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-08 14:38:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:38:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-08 14:38:12,842 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 111 [2025-03-08 14:38:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:38:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-08 14:38:12,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-08 14:38:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:38:12,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:12,844 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:12,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:38:12,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 43862910, now seen corresponding path program 1 times [2025-03-08 14:38:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:38:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788199967] [2025-03-08 14:38:12,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:38:12,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:38:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:38:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:38:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76261734] [2025-03-08 14:38:12,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:12,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:38:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:38:12,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:38:12,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:38:12,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:38:12,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:38:12,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:12,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:38:12,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:38:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:38:13,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:38:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:38:13,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:38:13,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:38:13,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:38:13,072 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-08 14:38:13,269 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,SelfDestructingSolverStorable3 [2025-03-08 14:38:13,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 14:38:13,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:38:13,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:38:13 BoogieIcfgContainer [2025-03-08 14:38:13,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:38:13,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:38:13,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:38:13,319 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:38:13,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:38:11" (3/4) ... [2025-03-08 14:38:13,321 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:38:13,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:38:13,322 INFO L158 Benchmark]: Toolchain (without parser) took 2520.09ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 66.1MB in the end (delta: 47.8MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-03-08 14:38:13,322 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:38:13,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.34ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:38:13,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.60ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:38:13,323 INFO L158 Benchmark]: Boogie Preprocessor took 32.43ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:38:13,323 INFO L158 Benchmark]: IcfgBuilder took 290.84ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 78.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:38:13,323 INFO L158 Benchmark]: TraceAbstraction took 1943.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 67.0MB in the end (delta: 11.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2025-03-08 14:38:13,324 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:38:13,325 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.59ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.34ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.60ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.43ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 290.84ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 78.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1943.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 67.0MB in the end (delta: 11.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] signed char var_1_9 = 25; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] float var_1_12 = 0.25; [L34] unsigned short int var_1_13 = 54726; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L74] var_1_5 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L77] var_1_6 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L80] var_1_8 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L81] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) [L39] signed char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] EXPR var_1_6 & var_1_3 VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] COND TRUE ((~ var_1_5) * (var_1_6 & var_1_3)) >= stepLocal_0 [L41] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L43] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L44] COND FALSE !(stepLocal_1 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L47] signed long int stepLocal_4 = var_1_13 - var_1_5; [L48] unsigned char stepLocal_3 = var_1_10; [L49] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L50] COND FALSE !(var_1_11 || stepLocal_3) [L61] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_2=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95-L96] return (((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1)) && ((var_1_10 && var_1_11) ? (var_1_9 == ((signed char) (var_1_3 - var_1_2))) : 1)) && ((var_1_11 || var_1_10) ? ((var_1_10 || (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) < 32)) ? (((var_1_13 - var_1_5) < var_1_2) ? (var_1_12 == ((float) var_1_8)) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 274 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:38:13,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:38:15,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:38:15,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:38:15,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:38:15,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:38:15,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:38:15,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:38:15,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:38:15,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:38:15,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:38:15,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:38:15,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:38:15,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:38:15,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:38:15,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:38:15,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:38:15,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:38:15,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:38:15,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:38:15,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:38:15,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:38:15,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:38:15,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:38:15,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:38:15,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:38:15,218 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2025-03-08 14:38:15,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:38:15,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:38:15,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:38:15,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:38:15,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:38:15,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:16,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86324f297/c7ea47a537ff452983dbd160f50222df/FLAG08d83a416 [2025-03-08 14:38:16,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:38:16,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:16,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86324f297/c7ea47a537ff452983dbd160f50222df/FLAG08d83a416 [2025-03-08 14:38:17,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86324f297/c7ea47a537ff452983dbd160f50222df [2025-03-08 14:38:17,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:38:17,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:38:17,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:38:17,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:38:17,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:38:17,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148ffd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17, skipping insertion in model container [2025-03-08 14:38:17,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:38:17,293 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_25-while_file-92.i[915,928] [2025-03-08 14:38:17,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:38:17,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:38:17,351 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_25-while_file-92.i[915,928] [2025-03-08 14:38:17,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:38:17,380 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:38:17,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17 WrapperNode [2025-03-08 14:38:17,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:38:17,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:38:17,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:38:17,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:38:17,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,414 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-08 14:38:17,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:38:17,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:38:17,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:38:17,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:38:17,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,434 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:38:17,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:38:17,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:38:17,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:38:17,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:38:17,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (1/1) ... [2025-03-08 14:38:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:38:17,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:38:17,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:38:17,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:38:17,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:38:17,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:38:17,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:38:17,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:38:17,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:38:17,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:38:17,545 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:38:17,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:38:18,108 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 14:38:18,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:38:18,117 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:38:18,117 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:38:18,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:38:18 BoogieIcfgContainer [2025-03-08 14:38:18,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:38:18,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:38:18,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:38:18,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:38:18,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:38:17" (1/3) ... [2025-03-08 14:38:18,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb12beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:38:18, skipping insertion in model container [2025-03-08 14:38:18,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:38:17" (2/3) ... [2025-03-08 14:38:18,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb12beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:38:18, skipping insertion in model container [2025-03-08 14:38:18,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:38:18" (3/3) ... [2025-03-08 14:38:18,127 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-08 14:38:18,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:38:18,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-92.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:38:18,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:38:18,189 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;@426f80b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:38:18,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:38:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:38:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:38:18,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:18,199 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:18,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 440035703, now seen corresponding path program 1 times [2025-03-08 14:38:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:38:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266523267] [2025-03-08 14:38:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:38:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:38:18,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:38:18,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:38:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:38:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:38:18,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:18,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:18,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:38:18,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:38:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 14:38:18,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:38:18,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:38:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266523267] [2025-03-08 14:38:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266523267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:38:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:38:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:38:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660654019] [2025-03-08 14:38:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:38:18,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:38:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:38:18,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:38:18,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:38:18,451 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:38:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:38:18,469 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-08 14:38:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:38:18,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 14:38:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:38:18,475 INFO L225 Difference]: With dead ends: 96 [2025-03-08 14:38:18,475 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:38:18,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:38:18,479 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:38:18,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:38:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:38:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:38:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:38:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-08 14:38:18,510 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 108 [2025-03-08 14:38:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:38:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-08 14:38:18,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:38:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-08 14:38:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:38:18,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:18,513 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:18,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:38:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:38:18,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:18,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:18,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1736614122, now seen corresponding path program 1 times [2025-03-08 14:38:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:38:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91723881] [2025-03-08 14:38:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:18,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:38:18,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:38:18,717 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:38:18,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:38:18,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:38:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:38:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:18,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:38:18,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:38:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:38:18,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:38:18,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:38:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91723881] [2025-03-08 14:38:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91723881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:38:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:38:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:38:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092436806] [2025-03-08 14:38:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:38:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:38:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:38:18,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:38:18,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:38:18,876 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:38:19,087 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2025-03-08 14:38:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:38:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:38:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:38:19,088 INFO L225 Difference]: With dead ends: 129 [2025-03-08 14:38:19,088 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 14:38:19,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 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-08 14:38:19,089 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:38:19,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:38:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 14:38:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-03-08 14:38:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:38:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2025-03-08 14:38:19,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 108 [2025-03-08 14:38:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:38:19,102 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2025-03-08 14:38:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:38:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2025-03-08 14:38:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:38:19,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:38:19,104 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:38:19,109 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-08 14:38:19,304 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-08 14:38:19,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:38:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:38:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -849110441, now seen corresponding path program 1 times [2025-03-08 14:38:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:38:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791232969] [2025-03-08 14:38:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:38:19,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:38:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:38:19,310 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-08 14:38:19,314 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-08 14:38:19,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:38:19,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:38:19,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:38:19,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:38:19,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 14:38:19,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:38:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 256 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-08 14:38:31,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:39:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 14:39:06,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:39:06,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791232969] [2025-03-08 14:39:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791232969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:39:06,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:39:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 31 [2025-03-08 14:39:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034996848] [2025-03-08 14:39:06,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:39:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 14:39:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:39:06,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 14:39:06,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2025-03-08 14:39:06,486 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 14:39:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:39:52,065 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2025-03-08 14:39:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 14:39:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) Word has length 108 [2025-03-08 14:39:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:39:52,075 INFO L225 Difference]: With dead ends: 167 [2025-03-08 14:39:52,075 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 14:39:52,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=563, Invalid=1987, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 14:39:52,077 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:39:52,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 378 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2025-03-08 14:39:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 14:39:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2025-03-08 14:39:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 91 states have (on average 1.120879120879121) internal successors, (102), 92 states have internal predecessors, (102), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:39:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2025-03-08 14:39:52,092 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 108 [2025-03-08 14:39:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:39:52,094 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2025-03-08 14:39:52,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 14:39:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2025-03-08 14:39:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:39:52,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:39:52,097 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:39:52,102 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-08 14:39:52,297 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-08 14:39:52,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:39:52,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:39:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1638402392, now seen corresponding path program 1 times [2025-03-08 14:39:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:39:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844576030] [2025-03-08 14:39:52,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:39:52,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:39:52,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:39:52,302 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-08 14:39:52,303 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-08 14:39:52,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:39:52,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:39:52,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:39:52,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:39:52,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 14:39:52,402 INFO L279 TraceCheckSpWp]: Computing forward predicates...