./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-33.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 cf462c69ab53d8bd054938ba0375925353699b3c48828163d51079382ad943c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:46:22,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:46:22,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:46:22,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:46:22,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:46:22,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:46:22,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:46:22,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:46:22,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:46:22,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:46:22,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:46:22,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:46:22,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:46:22,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:46:22,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:46:22,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:46:22,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:46:22,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:46:22,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:46:22,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:46:22,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:46:22,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:46:22,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:46:22,429 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 -> cf462c69ab53d8bd054938ba0375925353699b3c48828163d51079382ad943c2 [2025-03-08 10:46:22,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:46:22,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:46:22,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:46:22,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:46:22,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:46:22,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-33.i [2025-03-08 10:46:23,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd9cee1c/4c85459b02ad431983c3df1188bc6b77/FLAG0ee5a6ddd [2025-03-08 10:46:24,002 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:46:24,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-33.i [2025-03-08 10:46:24,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd9cee1c/4c85459b02ad431983c3df1188bc6b77/FLAG0ee5a6ddd [2025-03-08 10:46:24,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd9cee1c/4c85459b02ad431983c3df1188bc6b77 [2025-03-08 10:46:24,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:46:24,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:46:24,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:46:24,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:46:24,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:46:24,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740cb423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24, skipping insertion in model container [2025-03-08 10:46:24,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:46:24,449 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_fillercode_fillercodesize_ps-cn-10_file-33.i[915,928] [2025-03-08 10:46:24,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:46:24,497 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:46:24,504 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_fillercode_fillercodesize_ps-cn-10_file-33.i[915,928] [2025-03-08 10:46:24,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:46:24,555 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:46:24,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24 WrapperNode [2025-03-08 10:46:24,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:46:24,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:46:24,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:46:24,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:46:24,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,605 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-03-08 10:46:24,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:46:24,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:46:24,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:46:24,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:46:24,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,640 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:46:24,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:46:24,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:46:24,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:46:24,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:46:24,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:46:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:46:24,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:46:24,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:46:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:46:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:46:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:46:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:46:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:46:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:46:24,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:46:24,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:46:25,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L145: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1; [2025-03-08 10:46:25,086 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 10:46:25,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:46:25,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:46:25,100 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:46:25,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:25 BoogieIcfgContainer [2025-03-08 10:46:25,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:46:25,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:46:25,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:46:25,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:46:25,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:46:24" (1/3) ... [2025-03-08 10:46:25,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cc200f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:25, skipping insertion in model container [2025-03-08 10:46:25,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (2/3) ... [2025-03-08 10:46:25,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cc200f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:25, skipping insertion in model container [2025-03-08 10:46:25,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:25" (3/3) ... [2025-03-08 10:46:25,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-33.i [2025-03-08 10:46:25,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:46:25,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-33.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:46:25,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:46:25,157 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;@179072cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:46:25,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:46:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:46:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 10:46:25,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:25,170 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:25,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:25,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1370640704, now seen corresponding path program 1 times [2025-03-08 10:46:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062944225] [2025-03-08 10:46:25,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:25,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 10:46:25,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 10:46:25,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:25,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 10:46:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062944225] [2025-03-08 10:46:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062944225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:46:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001326282] [2025-03-08 10:46:25,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:46:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:46:25,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:46:25,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:46:25,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 10:46:25,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 10:46:25,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:25,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:25,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:46:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:46:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 10:46:25,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:46:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001326282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:25,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:46:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:46:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518821554] [2025-03-08 10:46:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:25,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:46:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:25,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:46:25,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:46:25,666 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:46:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:25,698 INFO L93 Difference]: Finished difference Result 162 states and 280 transitions. [2025-03-08 10:46:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:46:25,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2025-03-08 10:46:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:25,706 INFO L225 Difference]: With dead ends: 162 [2025-03-08 10:46:25,707 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 10:46:25,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:46:25,712 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:25,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:46:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 10:46:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 10:46:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 10:46:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2025-03-08 10:46:25,745 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 182 [2025-03-08 10:46:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2025-03-08 10:46:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 10:46:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2025-03-08 10:46:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 10:46:25,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:25,749 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:25,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:46:25,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:46:25,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:25,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash -379774113, now seen corresponding path program 1 times [2025-03-08 10:46:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531510407] [2025-03-08 10:46:25,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:25,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:25,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 10:46:26,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 10:46:26,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:26,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:46:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531510407] [2025-03-08 10:46:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531510407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:46:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799682531] [2025-03-08 10:46:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:46:26,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:26,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:46:26,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:46:26,762 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:27,047 INFO L93 Difference]: Finished difference Result 242 states and 368 transitions. [2025-03-08 10:46:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:46:27,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2025-03-08 10:46:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:27,051 INFO L225 Difference]: With dead ends: 242 [2025-03-08 10:46:27,051 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 10:46:27,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:46:27,052 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:27,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 302 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:46:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 10:46:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2025-03-08 10:46:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:46:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2025-03-08 10:46:27,092 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 182 [2025-03-08 10:46:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:27,093 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2025-03-08 10:46:27,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2025-03-08 10:46:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 10:46:27,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:27,095 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:27,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:46:27,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:27,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1442135221, now seen corresponding path program 1 times [2025-03-08 10:46:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985621965] [2025-03-08 10:46:27,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:27,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 10:46:27,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 10:46:27,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:27,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:46:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:27,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985621965] [2025-03-08 10:46:27,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985621965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:27,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:27,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:46:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399181006] [2025-03-08 10:46:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:27,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:46:27,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:27,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:46:27,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:46:27,344 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:27,560 INFO L93 Difference]: Finished difference Result 251 states and 379 transitions. [2025-03-08 10:46:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:46:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2025-03-08 10:46:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:27,562 INFO L225 Difference]: With dead ends: 251 [2025-03-08 10:46:27,562 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 10:46:27,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:46:27,563 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 77 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:27,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 307 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:46:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 10:46:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2025-03-08 10:46:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:46:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2025-03-08 10:46:27,589 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 183 [2025-03-08 10:46:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:27,589 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2025-03-08 10:46:27,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2025-03-08 10:46:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 10:46:27,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:27,593 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:46:27,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash -284337629, now seen corresponding path program 1 times [2025-03-08 10:46:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820667656] [2025-03-08 10:46:27,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 10:46:27,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 10:46:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 10:46:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820667656] [2025-03-08 10:46:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820667656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 10:46:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999947750] [2025-03-08 10:46:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 10:46:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 10:46:33,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:46:33,749 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:36,120 INFO L93 Difference]: Finished difference Result 394 states and 577 transitions. [2025-03-08 10:46:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:46:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2025-03-08 10:46:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:36,123 INFO L225 Difference]: With dead ends: 394 [2025-03-08 10:46:36,123 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 10:46:36,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 10:46:36,124 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 270 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:36,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1020 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 10:46:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 10:46:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 263. [2025-03-08 10:46:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 171 states have (on average 1.280701754385965) internal successors, (219), 171 states have internal predecessors, (219), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 10:46:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2025-03-08 10:46:36,168 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 184 [2025-03-08 10:46:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2025-03-08 10:46:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 10:46:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2025-03-08 10:46:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 10:46:36,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:36,171 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:36,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:46:36,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:36,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash -480851134, now seen corresponding path program 1 times [2025-03-08 10:46:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030392611] [2025-03-08 10:46:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 10:46:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 10:46:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat