./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-64.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_codestructure_steplocals_file-64.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 f28c6e39e7c9acbcbeaefe28cdbb3f08f78e3f387cf9ac751f49bf5d9fb6ae78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:15:55,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:15:55,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:15:55,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:15:55,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:15:55,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:15:55,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:15:55,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:15:55,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:15:55,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:15:55,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:15:55,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:15:55,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:15:55,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:15:55,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:15:55,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:15:55,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:15:55,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:15:55,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:15:55,821 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 -> f28c6e39e7c9acbcbeaefe28cdbb3f08f78e3f387cf9ac751f49bf5d9fb6ae78 [2025-03-08 10:15:56,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:15:56,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:15:56,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:15:56,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:15:56,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:15:56,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-64.i [2025-03-08 10:15:57,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc31af42/8a3897872b95476991ad840f29899b56/FLAG22449fdc0 [2025-03-08 10:15:57,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:15:57,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-64.i [2025-03-08 10:15:57,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc31af42/8a3897872b95476991ad840f29899b56/FLAG22449fdc0 [2025-03-08 10:15:57,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc31af42/8a3897872b95476991ad840f29899b56 [2025-03-08 10:15:57,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:15:57,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:15:57,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:15:57,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:15:57,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:15:57,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:57,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e338290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57, skipping insertion in model container [2025-03-08 10:15:57,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:57,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:15:57,857 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_codestructure_steplocals_file-64.i[917,930] [2025-03-08 10:15:57,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:15:57,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:15:57,926 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_codestructure_steplocals_file-64.i[917,930] [2025-03-08 10:15:57,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:15:57,961 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:15:57,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57 WrapperNode [2025-03-08 10:15:57,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:15:57,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:15:57,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:15:57,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:15:57,968 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:15:57" (1/1) ... [2025-03-08 10:15:57,974 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:15:57" (1/1) ... [2025-03-08 10:15:57,994 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2025-03-08 10:15:57,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:15:57,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:15:57,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:15:57,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:15:58,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,012 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:15:58,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:15:58,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:15:58,020 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:15:58,020 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:15:58,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 10:15:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:15:58,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:15:58,051 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:15:58,056 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:15:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:15:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:15:58,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:15:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:15:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:15:58,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:15:58,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:15:58,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:15:58,367 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-03-08 10:15:58,399 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 10:15:58,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:15:58,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:15:58,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:15:58,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:58 BoogieIcfgContainer [2025-03-08 10:15:58,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:15:58,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:15:58,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:15:58,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:15:58,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:15:57" (1/3) ... [2025-03-08 10:15:58,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc9b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:58, skipping insertion in model container [2025-03-08 10:15:58,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (2/3) ... [2025-03-08 10:15:58,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc9b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:58, skipping insertion in model container [2025-03-08 10:15:58,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:58" (3/3) ... [2025-03-08 10:15:58,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-64.i [2025-03-08 10:15:58,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:15:58,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-64.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:15:58,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:15:58,475 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;@753f9586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:15:58,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:15:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 57 states have internal predecessors, (72), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:15:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 10:15:58,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:15:58,490 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:15:58,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:15:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1346341651, now seen corresponding path program 1 times [2025-03-08 10:15:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:15:58,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732198914] [2025-03-08 10:15:58,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:15:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:15:58,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 10:15:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 10:15:58,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:15:58,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:15:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-08 10:15:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:15:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732198914] [2025-03-08 10:15:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732198914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:15:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704095633] [2025-03-08 10:15:58,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:15:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:15:58,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:15:58,815 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:15:58,817 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:15:58,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 10:15:59,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 10:15:59,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:15:59,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:15:59,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:15:59,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:15:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-08 10:15:59,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:15:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704095633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:15:59,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:15:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:15:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606477586] [2025-03-08 10:15:59,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:15:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:15:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:15:59,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:15:59,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:15:59,075 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 57 states have internal predecessors, (72), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:15:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:15:59,104 INFO L93 Difference]: Finished difference Result 200 states and 359 transitions. [2025-03-08 10:15:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:15:59,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 264 [2025-03-08 10:15:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:15:59,109 INFO L225 Difference]: With dead ends: 200 [2025-03-08 10:15:59,110 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 10:15:59,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 265 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:15:59,118 INFO L435 NwaCegarLoop]: 153 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, 153 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:15:59,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:15:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 10:15:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 10:15:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:15:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2025-03-08 10:15:59,152 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 264 [2025-03-08 10:15:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:15:59,153 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2025-03-08 10:15:59,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 10:15:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2025-03-08 10:15:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 10:15:59,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:15:59,158 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:59,165 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:15:59,358 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:15:59,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:15:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:15:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1069061907, now seen corresponding path program 1 times [2025-03-08 10:15:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:15:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980318497] [2025-03-08 10:15:59,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:15:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:15:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 10:15:59,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 10:15:59,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:15:59,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 10:16:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980318497] [2025-03-08 10:16:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980318497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:16:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670832838] [2025-03-08 10:16:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:00,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:16:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:00,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:16:00,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:16:00,350 INFO L87 Difference]: Start difference. First operand 100 states and 155 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:00,537 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2025-03-08 10:16:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:16:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 264 [2025-03-08 10:16:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:00,540 INFO L225 Difference]: With dead ends: 221 [2025-03-08 10:16:00,542 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 10:16:00,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:00,543 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:00,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 531 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:16:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 10:16:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2025-03-08 10:16:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:16:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2025-03-08 10:16:00,560 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 264 [2025-03-08 10:16:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:00,564 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2025-03-08 10:16:00,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2025-03-08 10:16:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 10:16:00,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:00,569 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:16:00,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -736820564, now seen corresponding path program 1 times [2025-03-08 10:16:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489146628] [2025-03-08 10:16:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:00,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 10:16:00,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 10:16:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 10:16:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489146628] [2025-03-08 10:16:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489146628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:16:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615443371] [2025-03-08 10:16:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:16:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:16:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:16:00,872 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:00,987 INFO L93 Difference]: Finished difference Result 258 states and 392 transitions. [2025-03-08 10:16:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:16:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 264 [2025-03-08 10:16:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:00,992 INFO L225 Difference]: With dead ends: 258 [2025-03-08 10:16:00,992 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 10:16:00,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:16:00,993 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 57 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:00,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 595 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:16:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 10:16:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2025-03-08 10:16:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:16:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2025-03-08 10:16:01,003 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 264 [2025-03-08 10:16:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:01,004 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2025-03-08 10:16:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2025-03-08 10:16:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 10:16:01,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:01,006 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:01,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:16:01,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:01,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1247354741, now seen corresponding path program 1 times [2025-03-08 10:16:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882647278] [2025-03-08 10:16:01,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:01,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 10:16:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 10:16:01,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 10:16:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882647278] [2025-03-08 10:16:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882647278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:16:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127008289] [2025-03-08 10:16:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:01,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:16:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:01,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:16:01,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:16:01,254 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:01,346 INFO L93 Difference]: Finished difference Result 258 states and 391 transitions. [2025-03-08 10:16:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:16:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 264 [2025-03-08 10:16:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:01,350 INFO L225 Difference]: With dead ends: 258 [2025-03-08 10:16:01,350 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 10:16:01,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:16:01,351 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 56 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:01,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 527 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:16:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 10:16:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2025-03-08 10:16:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:16:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2025-03-08 10:16:01,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 264 [2025-03-08 10:16:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:01,367 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2025-03-08 10:16:01,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 10:16:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2025-03-08 10:16:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 10:16:01,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:01,369 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:01,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:16:01,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1697708117, now seen corresponding path program 1 times [2025-03-08 10:16:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901920471] [2025-03-08 10:16:01,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:01,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 10:16:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 10:16:01,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat