./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 1d6c4a3eb939cf020f1f398aaea8bced5e253e36982909d5638c614d47e14ed7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:39:53,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:39:53,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:39:53,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:39:53,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:39:53,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:39:53,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:39:53,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:39:53,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:39:53,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:39:53,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:39:53,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:39:53,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:39:53,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:39:53,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:39:53,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:39:53,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:39:53,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:39:53,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:39:53,208 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d6c4a3eb939cf020f1f398aaea8bced5e253e36982909d5638c614d47e14ed7 [2025-03-16 22:39:53,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:39:53,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:39:53,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:39:53,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:39:53,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:39:53,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c [2025-03-16 22:39:54,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2a510cc/f93a68a4bcdf42f8a3987a069449d260/FLAG39424e430 [2025-03-16 22:39:54,860 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:39:54,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c [2025-03-16 22:39:54,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2a510cc/f93a68a4bcdf42f8a3987a069449d260/FLAG39424e430 [2025-03-16 22:39:55,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2a510cc/f93a68a4bcdf42f8a3987a069449d260 [2025-03-16 22:39:55,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:39:55,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:39:55,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:39:55,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:39:55,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:39:55,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:39:55" (1/1) ... [2025-03-16 22:39:55,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb9cd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:55, skipping insertion in model container [2025-03-16 22:39:55,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:39:55" (1/1) ... [2025-03-16 22:39:55,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:39:55,303 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/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c[1176,1189] [2025-03-16 22:39:55,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:39:55,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:39:55,795 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/hardware-verification-bv/btor2c-lazyMod.szymanski.5.prop1-func-interl.c[1176,1189] [2025-03-16 22:39:56,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:39:56,067 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:39:56,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56 WrapperNode [2025-03-16 22:39:56,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:39:56,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:39:56,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:39:56,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:39:56,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:56,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:57,774 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 20978 [2025-03-16 22:39:57,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:39:57,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:39:57,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:39:57,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:39:57,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:57,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:58,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:58,604 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-16 22:39:58,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:58,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:58,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:59,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:59,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:59,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:59,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:39:59,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:39:59,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:39:59,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:39:59,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (1/1) ... [2025-03-16 22:39:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:39:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:39:59,523 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-16 22:39:59,528 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-16 22:39:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:39:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:39:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:39:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:40:00,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:40:00,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:40:53,320 INFO L? ?]: Removed 12006 outVars from TransFormulas that were not future-live. [2025-03-16 22:40:53,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:40:53,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:40:53,714 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:40:53,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:40:53 BoogieIcfgContainer [2025-03-16 22:40:53,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:40:53,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:40:53,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:40:53,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:40:53,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:39:55" (1/3) ... [2025-03-16 22:40:53,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3f0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:40:53, skipping insertion in model container [2025-03-16 22:40:53,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:39:56" (2/3) ... [2025-03-16 22:40:53,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3f0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:40:53, skipping insertion in model container [2025-03-16 22:40:53,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:40:53" (3/3) ... [2025-03-16 22:40:53,724 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.szymanski.5.prop1-func-interl.c [2025-03-16 22:40:53,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:40:53,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.szymanski.5.prop1-func-interl.c that has 1 procedures, 7296 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:40:53,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:40:53,895 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;@20baf28f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:40:53,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:40:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 7296 states, 7294 states have (on average 1.5) internal successors, (10941), 7295 states have internal predecessors, (10941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:40:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 22:40:53,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:40:53,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:40:53,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:40:53,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:40:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1750380038, now seen corresponding path program 1 times [2025-03-16 22:40:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:40:53,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453374630] [2025-03-16 22:40:53,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:40:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:40:54,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 22:40:54,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 22:40:54,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:40:54,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:40:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:40:55,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:40:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453374630] [2025-03-16 22:40:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453374630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:40:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:40:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:40:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401907177] [2025-03-16 22:40:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:40:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:40:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:40:55,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:40:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:40:55,460 INFO L87 Difference]: Start difference. First operand has 7296 states, 7294 states have (on average 1.5) internal successors, (10941), 7295 states have internal predecessors, (10941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:40:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:40:58,421 INFO L93 Difference]: Finished difference Result 14247 states and 21367 transitions. [2025-03-16 22:40:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:40:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-16 22:40:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:40:58,459 INFO L225 Difference]: With dead ends: 14247 [2025-03-16 22:40:58,460 INFO L226 Difference]: Without dead ends: 7296 [2025-03-16 22:40:58,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:40:58,476 INFO L435 NwaCegarLoop]: 9114 mSDtfsCounter, 0 mSDsluCounter, 18223 mSDsCounter, 0 mSdLazyCounter, 5476 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27337 SdHoareTripleChecker+Invalid, 5476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:40:58,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27337 Invalid, 5476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 5476 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 22:40:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2025-03-16 22:40:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 7296. [2025-03-16 22:40:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7296 states, 7295 states have (on average 1.4996572995202193) internal successors, (10940), 7295 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:40:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 10940 transitions. [2025-03-16 22:40:58,678 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 10940 transitions. Word has length 346 [2025-03-16 22:40:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:40:58,682 INFO L471 AbstractCegarLoop]: Abstraction has 7296 states and 10940 transitions. [2025-03-16 22:40:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:40:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 10940 transitions. [2025-03-16 22:40:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 22:40:58,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:40:58,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:40:58,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:40:58,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:40:58,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:40:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1568102970, now seen corresponding path program 1 times [2025-03-16 22:40:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:40:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214613134] [2025-03-16 22:40:58,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:40:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:40:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 22:40:58,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 22:40:58,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:40:58,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:40:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:40:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:40:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214613134] [2025-03-16 22:40:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214613134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:40:59,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:40:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:40:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836360147] [2025-03-16 22:40:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:40:59,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:40:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:40:59,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:40:59,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:40:59,301 INFO L87 Difference]: Start difference. First operand 7296 states and 10940 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:41:01,820 INFO L93 Difference]: Finished difference Result 14249 states and 21366 transitions. [2025-03-16 22:41:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:41:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-03-16 22:41:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:41:01,839 INFO L225 Difference]: With dead ends: 14249 [2025-03-16 22:41:01,839 INFO L226 Difference]: Without dead ends: 7298 [2025-03-16 22:41:01,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:41:01,848 INFO L435 NwaCegarLoop]: 9114 mSDtfsCounter, 0 mSDsluCounter, 18220 mSDsCounter, 0 mSdLazyCounter, 5479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27334 SdHoareTripleChecker+Invalid, 5479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:41:01,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27334 Invalid, 5479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5479 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 22:41:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7298 states. [2025-03-16 22:41:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7298 to 7298. [2025-03-16 22:41:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7298 states, 7297 states have (on average 1.499520350829108) internal successors, (10942), 7297 states have internal predecessors, (10942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 10942 transitions. [2025-03-16 22:41:01,961 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 10942 transitions. Word has length 347 [2025-03-16 22:41:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:41:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 7298 states and 10942 transitions. [2025-03-16 22:41:01,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 10942 transitions. [2025-03-16 22:41:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 22:41:01,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:41:01,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:41:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:41:01,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:41:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:41:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 564968961, now seen corresponding path program 1 times [2025-03-16 22:41:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:41:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822903245] [2025-03-16 22:41:01,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:41:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:41:02,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 22:41:02,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 22:41:02,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:41:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:41:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:41:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:41:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822903245] [2025-03-16 22:41:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822903245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:41:02,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:41:02,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:41:02,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446441116] [2025-03-16 22:41:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:41:02,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:41:02,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:41:02,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:41:02,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:41:02,612 INFO L87 Difference]: Start difference. First operand 7298 states and 10942 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:41:04,643 INFO L93 Difference]: Finished difference Result 14253 states and 21370 transitions. [2025-03-16 22:41:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:41:04,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-03-16 22:41:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:41:04,660 INFO L225 Difference]: With dead ends: 14253 [2025-03-16 22:41:04,661 INFO L226 Difference]: Without dead ends: 7300 [2025-03-16 22:41:04,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:41:04,669 INFO L435 NwaCegarLoop]: 9114 mSDtfsCounter, 0 mSDsluCounter, 18215 mSDsCounter, 0 mSdLazyCounter, 5484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27329 SdHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:41:04,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27329 Invalid, 5484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5484 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 22:41:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2025-03-16 22:41:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 7300. [2025-03-16 22:41:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7300 states, 7299 states have (on average 1.499383477188656) internal successors, (10944), 7299 states have internal predecessors, (10944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 10944 transitions. [2025-03-16 22:41:04,773 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 10944 transitions. Word has length 348 [2025-03-16 22:41:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:41:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 7300 states and 10944 transitions. [2025-03-16 22:41:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 10944 transitions. [2025-03-16 22:41:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 22:41:04,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:41:04,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:41:04,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:41:04,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:41:04,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:41:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2072424629, now seen corresponding path program 1 times [2025-03-16 22:41:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:41:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166712070] [2025-03-16 22:41:04,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:41:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:41:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 22:41:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 22:41:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:41:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:41:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:41:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:41:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166712070] [2025-03-16 22:41:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166712070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:41:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:41:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:41:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836203948] [2025-03-16 22:41:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:41:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:41:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:41:05,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:41:05,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:41:05,234 INFO L87 Difference]: Start difference. First operand 7300 states and 10944 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:41:07,373 INFO L93 Difference]: Finished difference Result 14263 states and 21382 transitions. [2025-03-16 22:41:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:41:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-16 22:41:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:41:07,389 INFO L225 Difference]: With dead ends: 14263 [2025-03-16 22:41:07,390 INFO L226 Difference]: Without dead ends: 7308 [2025-03-16 22:41:07,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:41:07,397 INFO L435 NwaCegarLoop]: 9114 mSDtfsCounter, 3 mSDsluCounter, 18215 mSDsCounter, 0 mSdLazyCounter, 5484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27329 SdHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:41:07,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27329 Invalid, 5484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5484 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 22:41:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2025-03-16 22:41:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 7304. [2025-03-16 22:41:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7304 states, 7303 states have (on average 1.4993838148706011) internal successors, (10950), 7303 states have internal predecessors, (10950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 10950 transitions. [2025-03-16 22:41:07,499 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 10950 transitions. Word has length 349 [2025-03-16 22:41:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:41:07,499 INFO L471 AbstractCegarLoop]: Abstraction has 7304 states and 10950 transitions. [2025-03-16 22:41:07,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 10950 transitions. [2025-03-16 22:41:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 22:41:07,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:41:07,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:41:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:41:07,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:41:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:41:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 879154940, now seen corresponding path program 1 times [2025-03-16 22:41:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:41:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199423058] [2025-03-16 22:41:07,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:41:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:41:07,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 22:41:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 22:41:07,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:41:07,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:41:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:41:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:41:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199423058] [2025-03-16 22:41:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199423058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:41:08,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:41:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:41:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624738057] [2025-03-16 22:41:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:41:08,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:41:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:41:08,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:41:08,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:41:08,260 INFO L87 Difference]: Start difference. First operand 7304 states and 10950 transitions. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:41:14,750 INFO L93 Difference]: Finished difference Result 21206 states and 31792 transitions. [2025-03-16 22:41:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:41:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-03-16 22:41:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:41:14,774 INFO L225 Difference]: With dead ends: 21206 [2025-03-16 22:41:14,774 INFO L226 Difference]: Without dead ends: 14247 [2025-03-16 22:41:14,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:41:14,784 INFO L435 NwaCegarLoop]: 7255 mSDtfsCounter, 10583 mSDsluCounter, 21560 mSDsCounter, 0 mSdLazyCounter, 14420 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10583 SdHoareTripleChecker+Valid, 28815 SdHoareTripleChecker+Invalid, 14421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:41:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10583 Valid, 28815 Invalid, 14421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 14420 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-16 22:41:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14247 states. [2025-03-16 22:41:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14247 to 7631. [2025-03-16 22:41:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7631 states, 7630 states have (on average 1.4992136304062909) internal successors, (11439), 7630 states have internal predecessors, (11439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7631 states to 7631 states and 11439 transitions. [2025-03-16 22:41:14,924 INFO L78 Accepts]: Start accepts. Automaton has 7631 states and 11439 transitions. Word has length 350 [2025-03-16 22:41:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:41:14,925 INFO L471 AbstractCegarLoop]: Abstraction has 7631 states and 11439 transitions. [2025-03-16 22:41:14,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:41:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7631 states and 11439 transitions. [2025-03-16 22:41:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 22:41:14,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:41:14,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:41:14,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:41:14,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:41:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:41:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1718608087, now seen corresponding path program 1 times [2025-03-16 22:41:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:41:14,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046265444] [2025-03-16 22:41:14,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:41:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:41:14,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 22:41:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 22:41:15,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:41:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:41:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:41:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:41:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046265444] [2025-03-16 22:41:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046265444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:41:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:41:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:41:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050553203] [2025-03-16 22:41:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:41:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:41:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:41:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:41:15,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:41:15,379 INFO L87 Difference]: Start difference. First operand 7631 states and 11439 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)