./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-31.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_fillercode_fillercodestructure_filler-pr-co_file-31.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 8a2631f953a342b9ccba2223861eaca9a227bd30acbeeb97e8e7f1036b541190 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:25:52,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:25:52,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:25:52,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:25:52,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:25:52,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:25:52,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:25:52,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:25:52,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:25:52,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:25:52,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:25:52,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:25:52,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:25:52,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:25:52,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:25:52,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:25:52,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:25:52,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:25:52,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:25:52,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:25:52,738 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 -> 8a2631f953a342b9ccba2223861eaca9a227bd30acbeeb97e8e7f1036b541190 [2025-03-03 21:25:52,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:25:52,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:25:52,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:25:52,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:25:52,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:25:52,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-31.i [2025-03-03 21:25:54,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f559a7188/c31144a091f04d0eb355fdf7a676fcca/FLAG02faed26e [2025-03-03 21:25:54,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:25:54,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-31.i [2025-03-03 21:25:54,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f559a7188/c31144a091f04d0eb355fdf7a676fcca/FLAG02faed26e [2025-03-03 21:25:54,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f559a7188/c31144a091f04d0eb355fdf7a676fcca [2025-03-03 21:25:54,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:25:54,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:25:54,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:25:54,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:25:54,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:25:54,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:54" (1/1) ... [2025-03-03 21:25:54,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fe6360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:54, skipping insertion in model container [2025-03-03 21:25:54,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:54" (1/1) ... [2025-03-03 21:25:54,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:25:54,836 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_fillercodestructure_filler-pr-co_file-31.i[919,932] [2025-03-03 21:25:54,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:25:54,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:25:54,951 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_fillercodestructure_filler-pr-co_file-31.i[919,932] [2025-03-03 21:25:54,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:25:55,015 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:25:55,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55 WrapperNode [2025-03-03 21:25:55,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:25:55,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:25:55,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:25:55,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:25:55,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,079 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-03-03 21:25:55,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:25:55,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:25:55,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:25:55,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:25:55,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:25:55,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:25:55,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:25:55,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:25:55,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:25:55,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (1/1) ... [2025-03-03 21:25:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:25:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:25:55,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:25:55,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:25:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:25:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:25:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:25:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:25:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:25:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:25:55,250 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:25:55,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:25:55,626 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:25:55,627 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:25:55,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:25:55,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:25:55,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:55 BoogieIcfgContainer [2025-03-03 21:25:55,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:25:55,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:25:55,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:25:55,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:25:55,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:25:54" (1/3) ... [2025-03-03 21:25:55,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540855e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:55, skipping insertion in model container [2025-03-03 21:25:55,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:55" (2/3) ... [2025-03-03 21:25:55,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540855e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:55, skipping insertion in model container [2025-03-03 21:25:55,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:55" (3/3) ... [2025-03-03 21:25:55,649 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-31.i [2025-03-03 21:25:55,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:25:55,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-31.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:25:55,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:25:55,703 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;@2190183a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:25:55,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:25:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 69 states have internal predecessors, (94), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:25:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 21:25:55,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:25:55,720 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:25:55,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:25:55,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:25:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1716419575, now seen corresponding path program 1 times [2025-03-03 21:25:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:25:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102666632] [2025-03-03 21:25:55,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:25:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:25:55,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 21:25:55,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 21:25:55,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:25:55,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:25:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:25:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:25:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102666632] [2025-03-03 21:25:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102666632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:25:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618864838] [2025-03-03 21:25:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:25:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:25:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:25:56,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:25:56,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:25:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 21:25:56,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 21:25:56,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:25:56,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:25:56,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:25:56,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:25:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:25:56,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:25:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618864838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:25:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:25:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:25:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996693707] [2025-03-03 21:25:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:25:56,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:25:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:25:56,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:25:56,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:25:56,307 INFO L87 Difference]: Start difference. First operand has 119 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 69 states have internal predecessors, (94), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:25:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:25:56,334 INFO L93 Difference]: Finished difference Result 232 states and 423 transitions. [2025-03-03 21:25:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:25:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 290 [2025-03-03 21:25:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:25:56,345 INFO L225 Difference]: With dead ends: 232 [2025-03-03 21:25:56,345 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 21:25:56,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:25:56,349 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:25:56,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:25:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 21:25:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-03 21:25:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:25:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2025-03-03 21:25:56,384 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 185 transitions. Word has length 290 [2025-03-03 21:25:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:25:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 185 transitions. [2025-03-03 21:25:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:25:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 185 transitions. [2025-03-03 21:25:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 21:25:56,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:25:56,389 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:25:56,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:25:56,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:25:56,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:25:56,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:25:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1190727945, now seen corresponding path program 1 times [2025-03-03 21:25:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:25:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576232397] [2025-03-03 21:25:56,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:25:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:25:56,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 21:25:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 21:25:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:25:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:25:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:25:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:25:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576232397] [2025-03-03 21:25:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576232397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:25:56,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:25:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:25:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657108577] [2025-03-03 21:25:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:25:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:25:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:25:56,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:25:56,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:25:56,837 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:25:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:25:56,912 INFO L93 Difference]: Finished difference Result 341 states and 547 transitions. [2025-03-03 21:25:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:25:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 290 [2025-03-03 21:25:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:25:56,919 INFO L225 Difference]: With dead ends: 341 [2025-03-03 21:25:56,919 INFO L226 Difference]: Without dead ends: 228 [2025-03-03 21:25:56,920 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-03 21:25:56,921 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 169 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:25:56,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 507 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:25:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-03 21:25:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 129. [2025-03-03 21:25:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:25:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 207 transitions. [2025-03-03 21:25:56,947 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 207 transitions. Word has length 290 [2025-03-03 21:25:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:25:56,948 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 207 transitions. [2025-03-03 21:25:56,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:25:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 207 transitions. [2025-03-03 21:25:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 21:25:56,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:25:56,951 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:25:56,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:25:56,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:25:56,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:25:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 685169320, now seen corresponding path program 1 times [2025-03-03 21:25:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:25:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994676171] [2025-03-03 21:25:56,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:25:56,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:25:56,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 21:25:57,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 21:25:57,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:25:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:25:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:25:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:25:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994676171] [2025-03-03 21:25:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994676171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:25:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:25:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:25:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667290117] [2025-03-03 21:25:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:25:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:25:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:25:57,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:25:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:25:57,641 INFO L87 Difference]: Start difference. First operand 129 states and 207 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:25:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:25:57,868 INFO L93 Difference]: Finished difference Result 346 states and 558 transitions. [2025-03-03 21:25:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:25:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 290 [2025-03-03 21:25:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:25:57,872 INFO L225 Difference]: With dead ends: 346 [2025-03-03 21:25:57,872 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 21:25:57,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:25:57,873 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 65 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:25:57,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 423 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:25:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 21:25:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2025-03-03 21:25:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:25:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 341 transitions. [2025-03-03 21:25:57,914 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 341 transitions. Word has length 290 [2025-03-03 21:25:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:25:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 341 transitions. [2025-03-03 21:25:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:25:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 341 transitions. [2025-03-03 21:25:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 21:25:57,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:25:57,919 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:25:57,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:25:57,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:25:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:25:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2038479017, now seen corresponding path program 1 times [2025-03-03 21:25:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:25:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538745735] [2025-03-03 21:25:57,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:25:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:25:57,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 21:25:58,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 21:25:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:25:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:26:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:26:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:26:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538745735] [2025-03-03 21:26:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538745735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:26:02,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:26:02,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:26:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809049274] [2025-03-03 21:26:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:26:02,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:26:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:26:02,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:26:02,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:26:02,212 INFO L87 Difference]: Start difference. First operand 213 states and 341 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:26:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:26:03,079 INFO L93 Difference]: Finished difference Result 492 states and 770 transitions. [2025-03-03 21:26:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:26:03,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 290 [2025-03-03 21:26:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:26:03,082 INFO L225 Difference]: With dead ends: 492 [2025-03-03 21:26:03,082 INFO L226 Difference]: Without dead ends: 366 [2025-03-03 21:26:03,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:26:03,083 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 289 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:26:03,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1334 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:26:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-03 21:26:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 288. [2025-03-03 21:26:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 185 states have (on average 1.427027027027027) internal successors, (264), 186 states have internal predecessors, (264), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 21:26:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 460 transitions. [2025-03-03 21:26:03,132 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 460 transitions. Word has length 290 [2025-03-03 21:26:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:26:03,132 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 460 transitions. [2025-03-03 21:26:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:26:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 460 transitions. [2025-03-03 21:26:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 21:26:03,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:26:03,135 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:26:03,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:26:03,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:26:03,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:26:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 112527073, now seen corresponding path program 1 times [2025-03-03 21:26:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:26:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147303927] [2025-03-03 21:26:03,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:26:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:26:03,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 21:26:03,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 21:26:03,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:26:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat