./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:27:48,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:27:48,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:27:48,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:27:48,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:27:48,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:27:48,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:27:48,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:27:48,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:27:48,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:27:48,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:27:48,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:27:48,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:27:48,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:27:48,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:27:48,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:27:48,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:48,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:27:48,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:27:48,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:27:48,486 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2025-03-04 00:27:48,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:27:48,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:27:48,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:27:48,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:27:48,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:27:48,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2025-03-04 00:27:49,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e104ac530/c0da4456f1004bf289856ab70fed696c/FLAGff878bb7d [2025-03-04 00:27:50,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:27:50,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2025-03-04 00:27:50,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e104ac530/c0da4456f1004bf289856ab70fed696c/FLAGff878bb7d [2025-03-04 00:27:50,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e104ac530/c0da4456f1004bf289856ab70fed696c [2025-03-04 00:27:50,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:27:50,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:27:50,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:50,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:27:50,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:27:50,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50, skipping insertion in model container [2025-03-04 00:27:50,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:27:50,329 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_operatoramount_amount25_file-87.i[915,928] [2025-03-04 00:27:50,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:50,368 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:27:50,375 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_operatoramount_amount25_file-87.i[915,928] [2025-03-04 00:27:50,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:50,400 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:27:50,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50 WrapperNode [2025-03-04 00:27:50,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:50,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:50,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:27:50,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:27:50,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,427 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-04 00:27:50,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:50,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:27:50,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:27:50,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:27:50,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,449 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-04 00:27:50,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:27:50,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:27:50,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:27:50,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:27:50,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (1/1) ... [2025-03-04 00:27:50,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:50,489 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-04 00:27:50,491 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-04 00:27:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:27:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:27:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:27:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:27:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:27:50,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:27:50,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:27:50,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:27:50,761 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2025-03-04 00:27:50,791 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 00:27:50,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:27:50,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:27:50,803 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:27:50,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:50 BoogieIcfgContainer [2025-03-04 00:27:50,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:27:50,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:27:50,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:27:50,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:27:50,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:27:50" (1/3) ... [2025-03-04 00:27:50,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508d08d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:50, skipping insertion in model container [2025-03-04 00:27:50,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:50" (2/3) ... [2025-03-04 00:27:50,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508d08d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:50, skipping insertion in model container [2025-03-04 00:27:50,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:50" (3/3) ... [2025-03-04 00:27:50,814 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2025-03-04 00:27:50,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:27:50,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-87.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:27:50,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:27:50,884 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;@431e9d8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:27:50,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:27:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:27:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:27:50,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:50,899 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:50,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:50,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1094625662, now seen corresponding path program 1 times [2025-03-04 00:27:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997219106] [2025-03-04 00:27:50,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:50,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:27:51,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:27:51,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:27:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997219106] [2025-03-04 00:27:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997219106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:27:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523609468] [2025-03-04 00:27:51,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:51,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:27:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:51,112 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-04 00:27:51,114 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-04 00:27:51,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:27:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:27:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:51,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:27:51,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:27:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:27:51,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:27:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523609468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:51,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:27:51,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:27:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171812901] [2025-03-04 00:27:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:27:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:51,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:27:51,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:51,285 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:51,305 INFO L93 Difference]: Finished difference Result 106 states and 171 transitions. [2025-03-04 00:27:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:27:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2025-03-04 00:27:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:51,314 INFO L225 Difference]: With dead ends: 106 [2025-03-04 00:27:51,314 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 00:27:51,317 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-04 00:27:51,319 INFO L435 NwaCegarLoop]: 74 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, 74 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-04 00:27:51,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 00:27:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 00:27:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:27:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-04 00:27:51,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 96 [2025-03-04 00:27:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:51,348 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-04 00:27:51,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-04 00:27:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:27:51,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:51,351 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:51,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:27:51,554 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-04 00:27:51,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:51,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1291188032, now seen corresponding path program 1 times [2025-03-04 00:27:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302607976] [2025-03-04 00:27:51,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:51,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:27:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:27:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:27:54,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:54,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302607976] [2025-03-04 00:27:54,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302607976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:54,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:54,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:27:54,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794331924] [2025-03-04 00:27:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:54,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:27:54,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:54,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:27:54,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:27:54,862 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:54,998 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2025-03-04 00:27:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:27:54,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2025-03-04 00:27:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:55,000 INFO L225 Difference]: With dead ends: 124 [2025-03-04 00:27:55,000 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 00:27:55,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:27:55,002 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:55,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 198 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:27:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 00:27:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2025-03-04 00:27:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:27:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-03-04 00:27:55,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 96 [2025-03-04 00:27:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:55,018 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-03-04 00:27:55,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-03-04 00:27:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:27:55,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:55,021 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:27:55,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash -171775826, now seen corresponding path program 1 times [2025-03-04 00:27:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478821562] [2025-03-04 00:27:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:55,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:27:55,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:27:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:27:56,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:56,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478821562] [2025-03-04 00:27:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478821562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:27:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115756527] [2025-03-04 00:27:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:27:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:27:56,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:27:56,825 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:57,281 INFO L93 Difference]: Finished difference Result 206 states and 290 transitions. [2025-03-04 00:27:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:27:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-04 00:27:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:57,285 INFO L225 Difference]: With dead ends: 206 [2025-03-04 00:27:57,285 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 00:27:57,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:27:57,289 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:57,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 437 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:27:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 00:27:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 76. [2025-03-04 00:27:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:27:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2025-03-04 00:27:57,302 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 97 [2025-03-04 00:27:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:57,303 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2025-03-04 00:27:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2025-03-04 00:27:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:27:57,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:57,307 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:57,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:27:57,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:57,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -42693107, now seen corresponding path program 1 times [2025-03-04 00:27:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-03-04 00:27:57,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:57,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:27:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:27:57,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:57,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:27:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-03-04 00:27:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598386593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:27:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077727032] [2025-03-04 00:27:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:57,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:27:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:27:57,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:27:57,590 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:57,820 INFO L93 Difference]: Finished difference Result 213 states and 303 transitions. [2025-03-04 00:27:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:27:57,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-04 00:27:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:57,823 INFO L225 Difference]: With dead ends: 213 [2025-03-04 00:27:57,824 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 00:27:57,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:27:57,825 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 70 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:57,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:27:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 00:27:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2025-03-04 00:27:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.396039603960396) internal successors, (141), 102 states have internal predecessors, (141), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:27:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2025-03-04 00:27:57,838 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 97 [2025-03-04 00:27:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2025-03-04 00:27:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:27:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2025-03-04 00:27:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:27:57,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:57,840 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:57,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:27:57,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1335775983, now seen corresponding path program 1 times [2025-03-04 00:27:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062076935] [2025-03-04 00:27:57,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:27:57,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:27:57,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:57,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:27:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:58,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062076935] [2025-03-04 00:27:58,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062076935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:58,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:27:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362403492] [2025-03-04 00:27:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:58,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:27:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:58,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:27:58,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:27:58,538 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:58,973 INFO L93 Difference]: Finished difference Result 337 states and 480 transitions. [2025-03-04 00:27:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:27:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2025-03-04 00:27:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:58,975 INFO L225 Difference]: With dead ends: 337 [2025-03-04 00:27:58,975 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 00:27:58,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:27:58,976 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 169 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:58,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 552 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:27:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 00:27:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2025-03-04 00:27:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 151 states have internal predecessors, (205), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:27:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 269 transitions. [2025-03-04 00:27:59,003 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 269 transitions. Word has length 97 [2025-03-04 00:27:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:59,005 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 269 transitions. [2025-03-04 00:27:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2025-03-04 00:27:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:27:59,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:59,007 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:59,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:27:59,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:59,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1464858702, now seen corresponding path program 1 times [2025-03-04 00:27:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480046483] [2025-03-04 00:27:59,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:27:59,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:27:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:27:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480046483] [2025-03-04 00:27:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480046483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:59,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:59,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:27:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085167155] [2025-03-04 00:27:59,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:59,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:27:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:59,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:27:59,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:27:59,188 INFO L87 Difference]: Start difference. First operand 186 states and 269 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:59,302 INFO L93 Difference]: Finished difference Result 353 states and 511 transitions. [2025-03-04 00:27:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:27:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2025-03-04 00:27:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:59,304 INFO L225 Difference]: With dead ends: 353 [2025-03-04 00:27:59,304 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 00:27:59,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:27:59,305 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 93 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:59,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 216 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:27:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 00:27:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2025-03-04 00:27:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 141 states have internal predecessors, (188), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:27:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 252 transitions. [2025-03-04 00:27:59,322 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 252 transitions. Word has length 97 [2025-03-04 00:27:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:59,322 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 252 transitions. [2025-03-04 00:27:59,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:27:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 252 transitions. [2025-03-04 00:27:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 00:27:59,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:59,323 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:27:59,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:27:59,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash -412549442, now seen corresponding path program 1 times [2025-03-04 00:27:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416107029] [2025-03-04 00:27:59,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 00:27:59,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 00:27:59,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:28:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:28:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416107029] [2025-03-04 00:28:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416107029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:28:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370849803] [2025-03-04 00:28:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:01,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:28:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:28:01,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:28:01,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:28:01,216 INFO L87 Difference]: Start difference. First operand 176 states and 252 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:02,770 INFO L93 Difference]: Finished difference Result 340 states and 458 transitions. [2025-03-04 00:28:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:28:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-04 00:28:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:02,774 INFO L225 Difference]: With dead ends: 340 [2025-03-04 00:28:02,774 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 00:28:02,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:28:02,775 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 78 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:02,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 434 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:28:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 00:28:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2025-03-04 00:28:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 237 states have internal predecessors, (306), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:28:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 390 transitions. [2025-03-04 00:28:02,811 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 390 transitions. Word has length 98 [2025-03-04 00:28:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:02,814 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 390 transitions. [2025-03-04 00:28:02,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 390 transitions. [2025-03-04 00:28:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 00:28:02,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:02,816 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:28:02,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:02,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 867465367, now seen corresponding path program 1 times [2025-03-04 00:28:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:28:02,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829629880] [2025-03-04 00:28:02,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:28:02,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 00:28:02,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 00:28:02,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:02,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:28:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:28:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829629880] [2025-03-04 00:28:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829629880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:03,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:28:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470126611] [2025-03-04 00:28:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:28:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:28:03,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:28:03,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:28:03,964 INFO L87 Difference]: Start difference. First operand 282 states and 390 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:04,420 INFO L93 Difference]: Finished difference Result 498 states and 683 transitions. [2025-03-04 00:28:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:28:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-04 00:28:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:04,425 INFO L225 Difference]: With dead ends: 498 [2025-03-04 00:28:04,426 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 00:28:04,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:28:04,427 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:04,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 461 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:28:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 00:28:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 274. [2025-03-04 00:28:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 229 states have internal predecessors, (293), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:28:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 377 transitions. [2025-03-04 00:28:04,452 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 377 transitions. Word has length 98 [2025-03-04 00:28:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:04,452 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 377 transitions. [2025-03-04 00:28:04,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 377 transitions. [2025-03-04 00:28:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 00:28:04,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:04,453 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:04,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:28:04,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash 574062360, now seen corresponding path program 1 times [2025-03-04 00:28:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:28:04,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-03-04 00:28:04,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:28:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 00:28:04,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 00:28:04,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:04,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:28:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:28:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-03-04 00:28:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989418788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:28:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834279242] [2025-03-04 00:28:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:28:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:28:05,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:28:05,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:28:05,875 INFO L87 Difference]: Start difference. First operand 274 states and 377 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:06,490 INFO L93 Difference]: Finished difference Result 470 states and 643 transitions. [2025-03-04 00:28:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:28:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-04 00:28:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:06,493 INFO L225 Difference]: With dead ends: 470 [2025-03-04 00:28:06,493 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 00:28:06,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:28:06,494 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:06,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 436 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:28:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 00:28:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 274. [2025-03-04 00:28:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 229 states have internal predecessors, (292), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:28:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-03-04 00:28:06,514 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 98 [2025-03-04 00:28:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:06,514 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-03-04 00:28:06,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-03-04 00:28:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 00:28:06,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:06,515 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:06,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:28:06,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:06,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1596187523, now seen corresponding path program 1 times [2025-03-04 00:28:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:28:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032372820] [2025-03-04 00:28:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:28:06,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:28:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:28:06,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:28:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:28:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032372820] [2025-03-04 00:28:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032372820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:28:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088952912] [2025-03-04 00:28:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:28:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:28:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:28:06,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:28:06,553 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:06,596 INFO L93 Difference]: Finished difference Result 644 states and 874 transitions. [2025-03-04 00:28:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:28:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-03-04 00:28:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:06,599 INFO L225 Difference]: With dead ends: 644 [2025-03-04 00:28:06,599 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 00:28:06,599 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-04 00:28:06,600 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 26 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:06,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:28:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 00:28:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 295. [2025-03-04 00:28:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.3099173553719008) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 38 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 00:28:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 405 transitions. [2025-03-04 00:28:06,626 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 405 transitions. Word has length 99 [2025-03-04 00:28:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:06,626 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 405 transitions. [2025-03-04 00:28:06,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:28:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 405 transitions. [2025-03-04 00:28:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 00:28:06,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:06,627 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:28:06,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1531768586, now seen corresponding path program 1 times [2025-03-04 00:28:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:28:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839479153] [2025-03-04 00:28:06,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:28:06,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:28:06,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:28:06,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:28:06,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721762509] [2025-03-04 00:28:06,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:06,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:28:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:28:06,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:28:06,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:28:06,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:28:06,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:28:06,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:28:06,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:28:06,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:28:06,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:28:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:28:06,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:28:06,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:28:06,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:28:06,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 00:28:07,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:07,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:28:07,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:28:07 BoogieIcfgContainer [2025-03-04 00:28:07,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:28:07,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:28:07,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:28:07,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:28:07,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:50" (3/4) ... [2025-03-04 00:28:07,115 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:28:07,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:28:07,116 INFO L158 Benchmark]: Toolchain (without parser) took 16913.70ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 111.2MB in the beginning and 282.8MB in the end (delta: -171.7MB). Peak memory consumption was 289.6MB. Max. memory is 16.1GB. [2025-03-04 00:28:07,117 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:07,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.34ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:07,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:07,118 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:07,118 INFO L158 Benchmark]: IcfgBuilder took 346.69ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 78.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:28:07,118 INFO L158 Benchmark]: TraceAbstraction took 16306.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 78.6MB in the beginning and 283.0MB in the end (delta: -204.4MB). Peak memory consumption was 256.0MB. Max. memory is 16.1GB. [2025-03-04 00:28:07,118 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 604.0MB. Free memory was 283.0MB in the beginning and 282.8MB in the end (delta: 193.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:07,119 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.34ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 346.69ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 78.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16306.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 78.6MB in the beginning and 283.0MB in the end (delta: -204.4MB). Peak memory consumption was 256.0MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 604.0MB. Free memory was 283.0MB in the beginning and 282.8MB in the end (delta: 193.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L100] RET updateLastVariables() [L101] 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, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L101] RET updateVariables() [L102] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, stepLocal_1=-8, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-128, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, stepLocal_3=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, stepLocal_3=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, stepLocal_3=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-125, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=-125, var_1_2=1, var_1_3=-4294967421, var_1_4=-4294967296, var_1_5=-2, var_1_6=-126, var_1_7=99, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 707 mSDsluCounter, 3224 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2433 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1791 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 791 mSDtfsCounter, 1791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 323 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1267 NumberOfCodeBlocks, 1267 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 8354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 3978/4004 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-04 00:28:07,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:28:09,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:28:09,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:28:09,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:28:09,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:28:09,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:28:09,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:28:09,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:28:09,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:28:09,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:28:09,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:28:09,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:28:09,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:28:09,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:28:09,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:28:09,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:28:09,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:28:09,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:28:09,100 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2025-03-04 00:28:09,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:28:09,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:28:09,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:28:09,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:28:09,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:28:09,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2025-03-04 00:28:10,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a90671b/5d18cbaf919841ba80a31eff36fec3be/FLAGe721f9eba [2025-03-04 00:28:10,657 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:28:10,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2025-03-04 00:28:10,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a90671b/5d18cbaf919841ba80a31eff36fec3be/FLAGe721f9eba [2025-03-04 00:28:10,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a90671b/5d18cbaf919841ba80a31eff36fec3be [2025-03-04 00:28:10,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:28:10,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:28:10,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:28:10,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:28:10,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:28:10,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1deb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10, skipping insertion in model container [2025-03-04 00:28:10,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:28:10,803 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_operatoramount_amount25_file-87.i[915,928] [2025-03-04 00:28:10,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:28:10,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:28:10,868 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_operatoramount_amount25_file-87.i[915,928] [2025-03-04 00:28:10,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:28:10,893 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:28:10,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10 WrapperNode [2025-03-04 00:28:10,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:28:10,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:28:10,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:28:10,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:28:10,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,925 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-04 00:28:10,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:28:10,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:28:10,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:28:10,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:28:10,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,940 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-04 00:28:10,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:28:10,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:28:10,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:28:10,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:28:10,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (1/1) ... [2025-03-04 00:28:10,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:28:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:28:10,973 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-04 00:28:10,975 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-04 00:28:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:28:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:28:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:28:10,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:28:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:28:10,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:28:11,040 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:28:11,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:28:11,307 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:28:11,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:28:11,314 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:28:11,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:28:11,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:28:11 BoogieIcfgContainer [2025-03-04 00:28:11,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:28:11,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:28:11,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:28:11,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:28:11,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:28:10" (1/3) ... [2025-03-04 00:28:11,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:28:11, skipping insertion in model container [2025-03-04 00:28:11,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:10" (2/3) ... [2025-03-04 00:28:11,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:28:11, skipping insertion in model container [2025-03-04 00:28:11,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:28:11" (3/3) ... [2025-03-04 00:28:11,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2025-03-04 00:28:11,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:28:11,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-87.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:28:11,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:28:11,381 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;@468c08b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:28:11,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:28:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:28:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:28:11,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:11,394 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:11,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 719588101, now seen corresponding path program 1 times [2025-03-04 00:28:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:11,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412554001] [2025-03-04 00:28:11,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:11,408 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-04 00:28:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:11,411 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-04 00:28:11,412 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-04 00:28:11,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:28:11,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:28:11,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:11,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:11,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:28:11,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 00:28:11,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:11,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412554001] [2025-03-04 00:28:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412554001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:28:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119128362] [2025-03-04 00:28:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:28:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:28:11,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:28:11,600 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:28:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:11,620 INFO L93 Difference]: Finished difference Result 90 states and 149 transitions. [2025-03-04 00:28:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:28:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-04 00:28:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:11,628 INFO L225 Difference]: With dead ends: 90 [2025-03-04 00:28:11,628 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 00:28:11,630 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-04 00:28:11,633 INFO L435 NwaCegarLoop]: 65 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, 65 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-04 00:28:11,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:28:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 00:28:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 00:28:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:28:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2025-03-04 00:28:11,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 92 [2025-03-04 00:28:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:11,680 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2025-03-04 00:28:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:28:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2025-03-04 00:28:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:28:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:11,684 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:28:11,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:11,885 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-04 00:28:11,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:11,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1653896125, now seen corresponding path program 1 times [2025-03-04 00:28:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:11,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139011417] [2025-03-04 00:28:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:11,888 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-04 00:28:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:11,890 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-04 00:28:11,895 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-04 00:28:11,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:28:12,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:28:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:12,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:28:12,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 00:28:12,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:28:12,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139011417] [2025-03-04 00:28:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139011417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:28:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [948638434] [2025-03-04 00:28:12,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:28:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:28:12,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:28:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 00:28:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:28:12,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:28:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:12,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:28:12,785 INFO L279 TraceCheckSpWp]: Computing forward predicates...