./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-71.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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:42:55,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:42:55,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:42:55,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:42:55,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:42:55,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:42:55,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:42:55,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:42:55,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:42:55,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:42:55,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:42:55,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:42:55,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:42:55,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:42:55,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:42:55,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:42:55,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:42:55,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:42:55,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:42:55,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:42:55,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:42:55,375 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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2025-03-17 03:42:55,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:42:55,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:42:55,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:42:55,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:42:55,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:42:55,592 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-71.i [2025-03-17 03:42:56,696 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036fafb3e/06a3c9c4d4464316926d8d97a866187d/FLAGacb782309 [2025-03-17 03:42:56,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:42:56,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2025-03-17 03:42:56,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036fafb3e/06a3c9c4d4464316926d8d97a866187d/FLAGacb782309 [2025-03-17 03:42:56,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036fafb3e/06a3c9c4d4464316926d8d97a866187d [2025-03-17 03:42:56,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:42:56,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:42:56,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:42:56,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:42:56,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:42:56,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:42:56" (1/1) ... [2025-03-17 03:42:56,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eea268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:56, skipping insertion in model container [2025-03-17 03:42:56,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:42:56" (1/1) ... [2025-03-17 03:42:56,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:42:57,033 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-71.i[915,928] [2025-03-17 03:42:57,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:42:57,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:42:57,080 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-71.i[915,928] [2025-03-17 03:42:57,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:42:57,105 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:42:57,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57 WrapperNode [2025-03-17 03:42:57,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:42:57,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:42:57,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:42:57,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:42:57,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,143 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-17 03:42:57,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:42:57,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:42:57,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:42:57,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:42:57,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:42:57,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:42:57,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:42:57,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:42:57,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:42:57,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (1/1) ... [2025-03-17 03:42:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:42:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:42:57,213 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-17 03:42:57,219 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-17 03:42:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:42:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:42:57,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:42:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:42:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:42:57,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:42:57,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:42:57,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:42:57,464 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-17 03:42:57,490 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:42:57,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:42:57,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:42:57,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:42:57,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:57 BoogieIcfgContainer [2025-03-17 03:42:57,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:42:57,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:42:57,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:42:57,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:42:57,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:42:56" (1/3) ... [2025-03-17 03:42:57,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428fedba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:42:57, skipping insertion in model container [2025-03-17 03:42:57,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:42:57" (2/3) ... [2025-03-17 03:42:57,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428fedba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:42:57, skipping insertion in model container [2025-03-17 03:42:57,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:57" (3/3) ... [2025-03-17 03:42:57,510 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2025-03-17 03:42:57,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:42:57,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-71.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:42:57,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:42:57,567 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;@4cbf2281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:42:57,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:42:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:42:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 03:42:57,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:57,578 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:57,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:57,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1685224883, now seen corresponding path program 1 times [2025-03-17 03:42:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788535828] [2025-03-17 03:42:57,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:57,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 03:42:57,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 03:42:57,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:57,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:42:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:42:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788535828] [2025-03-17 03:42:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788535828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:42:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54949614] [2025-03-17 03:42:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:57,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:42:57,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:42:57,767 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-17 03:42:57,768 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-17 03:42:57,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 03:42:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 03:42:57,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:57,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:42:57,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:42:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:42:57,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:42:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54949614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:42:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:42:57,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:42:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721452723] [2025-03-17 03:42:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:42:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:42:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:42:57,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:42:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:42:57,911 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:42:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:42:57,927 INFO L93 Difference]: Finished difference Result 99 states and 163 transitions. [2025-03-17 03:42:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:42:57,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-17 03:42:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:42:57,934 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:42:57,934 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 03:42:57,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-17 03:42:57,938 INFO L435 NwaCegarLoop]: 69 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, 69 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-17 03:42:57,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:42:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 03:42:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 03:42:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:42:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-17 03:42:57,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 96 [2025-03-17 03:42:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:42:57,976 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-17 03:42:57,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:42:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-17 03:42:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 03:42:57,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:57,982 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:57,989 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-17 03:42:58,182 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-17 03:42:58,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1668931946, now seen corresponding path program 1 times [2025-03-17 03:42:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157551977] [2025-03-17 03:42:58,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:58,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 03:42:58,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 03:42:58,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:58,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:42:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:42:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157551977] [2025-03-17 03:42:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157551977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:42:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:42:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:42:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25173191] [2025-03-17 03:42:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:42:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:42:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:42:58,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:42:58,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:42:58,504 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:42:58,577 INFO L93 Difference]: Finished difference Result 102 states and 146 transitions. [2025-03-17 03:42:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:42:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2025-03-17 03:42:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:42:58,579 INFO L225 Difference]: With dead ends: 102 [2025-03-17 03:42:58,580 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 03:42:58,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:42:58,581 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:42:58,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 141 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:42:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 03:42:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 03:42:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:42:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2025-03-17 03:42:58,594 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 96 [2025-03-17 03:42:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:42:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2025-03-17 03:42:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2025-03-17 03:42:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 03:42:58,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:58,597 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:58,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:42:58,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:58,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash -622838753, now seen corresponding path program 1 times [2025-03-17 03:42:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559832928] [2025-03-17 03:42:58,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:58,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 03:42:58,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 03:42:58,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:42:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:42:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559832928] [2025-03-17 03:42:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559832928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:42:59,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:42:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:42:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536008223] [2025-03-17 03:42:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:42:59,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:42:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:42:59,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:42:59,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:42:59,152 INFO L87 Difference]: Start difference. First operand 54 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:42:59,312 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2025-03-17 03:42:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:42:59,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-17 03:42:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:42:59,314 INFO L225 Difference]: With dead ends: 125 [2025-03-17 03:42:59,316 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 03:42:59,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:42:59,317 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:42:59,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 228 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:42:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 03:42:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2025-03-17 03:42:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:42:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-17 03:42:59,329 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 97 [2025-03-17 03:42:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:42:59,330 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-17 03:42:59,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-17 03:42:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:42:59,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:59,332 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:42:59,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash -774307454, now seen corresponding path program 1 times [2025-03-17 03:42:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596523448] [2025-03-17 03:42:59,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:59,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:42:59,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:42:59,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:59,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:42:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:42:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596523448] [2025-03-17 03:42:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596523448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:42:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:42:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:42:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993867485] [2025-03-17 03:42:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:42:59,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:42:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:42:59,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:42:59,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:42:59,759 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:42:59,854 INFO L93 Difference]: Finished difference Result 151 states and 205 transitions. [2025-03-17 03:42:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:42:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-17 03:42:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:42:59,855 INFO L225 Difference]: With dead ends: 151 [2025-03-17 03:42:59,855 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 03:42:59,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:42:59,856 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 50 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:42:59,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 374 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:42:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 03:42:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2025-03-17 03:42:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:42:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-17 03:42:59,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 98 [2025-03-17 03:42:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:42:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-17 03:42:59,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-17 03:42:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:42:59,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:59,865 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:59,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:42:59,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -731970749, now seen corresponding path program 1 times [2025-03-17 03:42:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-17 03:42:59,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:59,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:42:59,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:42:59,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:59,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:42:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:42:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:42:59,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-17 03:42:59,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252862364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:42:59,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:42:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:42:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468849847] [2025-03-17 03:42:59,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:42:59,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:42:59,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:42:59,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:42:59,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:42:59,911 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:42:59,941 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2025-03-17 03:42:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:42:59,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-17 03:42:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:42:59,943 INFO L225 Difference]: With dead ends: 156 [2025-03-17 03:42:59,943 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 03:42:59,943 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-17 03:42:59,944 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:42:59,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 163 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:42:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 03:42:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-03-17 03:42:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:42:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2025-03-17 03:42:59,962 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 99 [2025-03-17 03:42:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:42:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2025-03-17 03:42:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:42:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2025-03-17 03:42:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:42:59,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:42:59,964 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:42:59,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:42:59,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:42:59,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:42:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 155532932, now seen corresponding path program 1 times [2025-03-17 03:42:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:42:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573657433] [2025-03-17 03:42:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:42:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:42:59,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:42:59,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:42:59,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:42:59,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:43:00,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:43:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573657433] [2025-03-17 03:43:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573657433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:43:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:43:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:43:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282160221] [2025-03-17 03:43:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:43:00,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:43:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:43:00,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:43:00,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:43:00,364 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:43:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:43:00,481 INFO L93 Difference]: Finished difference Result 203 states and 272 transitions. [2025-03-17 03:43:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:43:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-17 03:43:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:43:00,483 INFO L225 Difference]: With dead ends: 203 [2025-03-17 03:43:00,483 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 03:43:00,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:43:00,484 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 71 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:43:00,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 242 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:43:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 03:43:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2025-03-17 03:43:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 03:43:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2025-03-17 03:43:00,497 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 99 [2025-03-17 03:43:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:43:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2025-03-17 03:43:00,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:43:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2025-03-17 03:43:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:43:00,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:00,500 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:43:00,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:43:00,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1920980477, now seen corresponding path program 1 times [2025-03-17 03:43:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:43:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979501224] [2025-03-17 03:43:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:43:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:43:00,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:43:00,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:00,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:43:00,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:43:00,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:43:00,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:43:00,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:00,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:43:00,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:43:00,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:43:00,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:43:00,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:43:00,566 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:43:00,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:43:00,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:43:00 BoogieIcfgContainer [2025-03-17 03:43:00,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:43:00,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:43:00,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:43:00,619 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:43:00,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:42:57" (3/4) ... [2025-03-17 03:43:00,621 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:43:00,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:43:00,622 INFO L158 Benchmark]: Toolchain (without parser) took 3710.42ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 110.7MB in the beginning and 154.5MB in the end (delta: -43.8MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2025-03-17 03:43:00,622 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:00,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.41ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 97.3MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:43:00,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.81ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:00,623 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:43:00,623 INFO L158 Benchmark]: IcfgBuilder took 318.03ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 73.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:43:00,623 INFO L158 Benchmark]: TraceAbstraction took 3114.73ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 73.1MB in the beginning and 154.6MB in the end (delta: -81.5MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2025-03-17 03:43:00,624 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 302.0MB. Free memory was 154.6MB in the beginning and 154.5MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:43:00,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.41ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 97.3MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.81ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.03ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 73.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3114.73ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 73.1MB in the beginning and 154.6MB in the end (delta: -81.5MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 302.0MB. Free memory was 154.6MB in the beginning and 154.5MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. 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 88, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L103] RET updateVariables() [L104] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] COND TRUE (var_1_13 >> var_1_3) <= var_1_5 [L57] COND TRUE (25 > var_1_13) && var_1_7 [L58] var_1_8 = (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=127, var_1_2=1, var_1_3=0, var_1_4=127, var_1_5=126, var_1_6=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 1217 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 472 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 1466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2912/2940 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-17 03:43:00,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:43:02,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:43:02,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:43:02,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:43:02,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:43:02,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:43:02,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:43:02,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:43:02,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:43:02,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:43:02,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:43:02,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:43:02,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:43:02,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:43:02,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:43:02,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:43:02,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:43:02,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:43:02,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:02,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:43:02,510 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:43:02,511 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:43:02,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:43:02,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:43:02,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:43:02,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:43:02,511 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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2025-03-17 03:43:02,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:43:02,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:43:02,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:43:02,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:43:02,859 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:43:02,860 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-71.i [2025-03-17 03:43:03,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2b0715a/74ee489411fa429495b8f6b517d2d56a/FLAGe1f013b0d [2025-03-17 03:43:04,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:43:04,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2025-03-17 03:43:04,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2b0715a/74ee489411fa429495b8f6b517d2d56a/FLAGe1f013b0d [2025-03-17 03:43:04,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2b0715a/74ee489411fa429495b8f6b517d2d56a [2025-03-17 03:43:04,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:43:04,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:43:04,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:04,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:43:04,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:43:04,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad577b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04, skipping insertion in model container [2025-03-17 03:43:04,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:43:04,659 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-71.i[915,928] [2025-03-17 03:43:04,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:04,700 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:43:04,707 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-71.i[915,928] [2025-03-17 03:43:04,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:43:04,740 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:43:04,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04 WrapperNode [2025-03-17 03:43:04,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:43:04,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:04,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:43:04,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:43:04,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,769 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-17 03:43:04,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:43:04,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:43:04,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:43:04,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:43:04,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,785 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-17 03:43:04,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:43:04,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:43:04,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:43:04,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:43:04,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (1/1) ... [2025-03-17 03:43:04,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:43:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:43:04,827 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-17 03:43:04,830 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-17 03:43:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:43:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:43:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:43:04,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:43:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:43:04,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:43:04,913 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:43:04,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:43:05,209 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:43:05,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:43:05,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:43:05,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:43:05,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:05 BoogieIcfgContainer [2025-03-17 03:43:05,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:43:05,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:43:05,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:43:05,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:43:05,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:43:04" (1/3) ... [2025-03-17 03:43:05,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c125930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:05, skipping insertion in model container [2025-03-17 03:43:05,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:04" (2/3) ... [2025-03-17 03:43:05,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c125930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:05, skipping insertion in model container [2025-03-17 03:43:05,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:05" (3/3) ... [2025-03-17 03:43:05,223 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2025-03-17 03:43:05,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:43:05,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-71.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:43:05,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:43:05,281 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;@5221b812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:43:05,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:43:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:43:05,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:05,291 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:43:05,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 957755183, now seen corresponding path program 1 times [2025-03-17 03:43:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:43:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225012289] [2025-03-17 03:43:05,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:05,302 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-17 03:43:05,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:43:05,304 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-17 03:43:05,306 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-17 03:43:05,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:43:05,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:43:05,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:05,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:43:05,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:43:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-17 03:43:05,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:43:05,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:43:05,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225012289] [2025-03-17 03:43:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225012289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:43:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:43:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:43:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532315997] [2025-03-17 03:43:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:43:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:43:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:43:05,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:43:05,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:43:05,517 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:43:05,537 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2025-03-17 03:43:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:43:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2025-03-17 03:43:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:43:05,544 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:43:05,545 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:43:05,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-17 03:43:05,550 INFO L435 NwaCegarLoop]: 60 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, 60 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-17 03:43:05,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:43:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:43:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:43:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:43:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 03:43:05,621 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 92 [2025-03-17 03:43:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:43:05,622 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 03:43:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:43:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-17 03:43:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:43:05,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:43:05,626 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:43:05,634 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-17 03:43:05,831 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-17 03:43:05,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:43:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:43:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1554031820, now seen corresponding path program 1 times [2025-03-17 03:43:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:43:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205698584] [2025-03-17 03:43:05,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:43:05,833 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-17 03:43:05,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:43:05,835 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-17 03:43:05,836 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-17 03:43:05,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:43:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:43:05,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:43:05,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:43:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 03:43:05,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:43:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 03:43:06,901 INFO L312 TraceCheckSpWp]: Computing backward predicates...