./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d03be96f5a42bacbfd66f0e75d40a1010ab3b59c5edc8f9fdf0d49ffc0863e07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:56:25,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:56:25,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:56:25,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:56:25,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:56:25,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:56:25,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:56:25,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:56:25,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:56:25,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:56:25,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:56:25,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:56:25,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:56:25,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:56:25,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:56:25,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:56:25,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:56:25,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:56:25,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:56:25,140 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-jdk21/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 -> d03be96f5a42bacbfd66f0e75d40a1010ab3b59c5edc8f9fdf0d49ffc0863e07 [2025-01-09 06:56:25,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:56:25,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:56:25,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:56:25,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:56:25,399 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:56:25,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c [2025-01-09 06:56:26,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c09578707/0998838583b44d5eb2fe282710a35e3a/FLAGfb672a838 [2025-01-09 06:56:27,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:56:27,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c [2025-01-09 06:56:27,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c09578707/0998838583b44d5eb2fe282710a35e3a/FLAGfb672a838 [2025-01-09 06:56:27,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c09578707/0998838583b44d5eb2fe282710a35e3a [2025-01-09 06:56:27,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:56:27,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:56:27,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:56:27,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:56:27,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:56:27,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:27" (1/1) ... [2025-01-09 06:56:27,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372811b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:27, skipping insertion in model container [2025-01-09 06:56:27,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:27" (1/1) ... [2025-01-09 06:56:27,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:56:27,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c[1245,1258] [2025-01-09 06:56:28,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:56:28,472 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:56:28,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal68.c[1245,1258] [2025-01-09 06:56:29,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:56:29,016 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:56:29,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29 WrapperNode [2025-01-09 06:56:29,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:56:29,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:56:29,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:56:29,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:56:29,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:29,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:31,832 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37397 [2025-01-09 06:56:31,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:56:31,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:56:31,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:56:31,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:56:31,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:31,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:32,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:32,912 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:56:32,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:32,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:33,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:33,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:33,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:34,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:34,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:34,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:56:34,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:56:34,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:56:34,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:56:34,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (1/1) ... [2025-01-09 06:56:34,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:56:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:56:34,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:56:34,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:56:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:56:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:56:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:56:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:56:34,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:56:36,147 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:56:36,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:57:32,403 INFO L? ?]: Removed 20666 outVars from TransFormulas that were not future-live. [2025-01-09 06:57:32,403 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:57:32,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:57:32,517 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:57:32,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:57:32 BoogieIcfgContainer [2025-01-09 06:57:32,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:57:32,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:57:32,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:57:32,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:57:32,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:56:27" (1/3) ... [2025-01-09 06:57:32,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab2c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:57:32, skipping insertion in model container [2025-01-09 06:57:32,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:29" (2/3) ... [2025-01-09 06:57:32,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab2c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:57:32, skipping insertion in model container [2025-01-09 06:57:32,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:57:32" (3/3) ... [2025-01-09 06:57:32,527 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal68.c [2025-01-09 06:57:32,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:57:32,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal68.c that has 1 procedures, 12786 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:57:32,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:57:32,726 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;@47a4d08e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:57:32,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:57:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 12786 states, 12784 states have (on average 1.5003911138923653) internal successors, (19181), 12785 states have internal predecessors, (19181), 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-01-09 06:57:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 06:57:32,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:32,778 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] [2025-01-09 06:57:32,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -990499824, now seen corresponding path program 1 times [2025-01-09 06:57:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341398187] [2025-01-09 06:57:32,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:33,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 06:57:33,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 06:57:33,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:33,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:34,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:34,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341398187] [2025-01-09 06:57:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341398187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:57:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617369769] [2025-01-09 06:57:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:34,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:57:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:34,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:57:34,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:57:34,593 INFO L87 Difference]: Start difference. First operand has 12786 states, 12784 states have (on average 1.5003911138923653) internal successors, (19181), 12785 states have internal predecessors, (19181), 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 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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-01-09 06:57:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:57:35,012 INFO L93 Difference]: Finished difference Result 25413 states and 38127 transitions. [2025-01-09 06:57:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:57:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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 337 [2025-01-09 06:57:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:57:35,072 INFO L225 Difference]: With dead ends: 25413 [2025-01-09 06:57:35,072 INFO L226 Difference]: Without dead ends: 12785 [2025-01-09 06:57:35,089 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-01-09 06:57:35,091 INFO L435 NwaCegarLoop]: 19175 mSDtfsCounter, 0 mSDsluCounter, 38344 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57519 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:57:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57519 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:57:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12785 states. [2025-01-09 06:57:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12785 to 12785. [2025-01-09 06:57:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12785 states, 12784 states have (on average 1.5002346683354193) internal successors, (19179), 12784 states have internal predecessors, (19179), 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-01-09 06:57:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12785 states to 12785 states and 19179 transitions. [2025-01-09 06:57:35,388 INFO L78 Accepts]: Start accepts. Automaton has 12785 states and 19179 transitions. Word has length 337 [2025-01-09 06:57:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:57:35,390 INFO L471 AbstractCegarLoop]: Abstraction has 12785 states and 19179 transitions. [2025-01-09 06:57:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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-01-09 06:57:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 12785 states and 19179 transitions. [2025-01-09 06:57:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 06:57:35,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:35,395 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] [2025-01-09 06:57:35,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:57:35,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:35,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -639026161, now seen corresponding path program 1 times [2025-01-09 06:57:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374493069] [2025-01-09 06:57:35,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:35,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 06:57:35,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 06:57:35,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:35,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374493069] [2025-01-09 06:57:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374493069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:57:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829056199] [2025-01-09 06:57:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:36,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:57:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:36,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:57:36,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:57:36,107 INFO L87 Difference]: Start difference. First operand 12785 states and 19179 transitions. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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-01-09 06:57:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:57:36,387 INFO L93 Difference]: Finished difference Result 25414 states and 38125 transitions. [2025-01-09 06:57:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:57:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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 338 [2025-01-09 06:57:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:57:36,437 INFO L225 Difference]: With dead ends: 25414 [2025-01-09 06:57:36,437 INFO L226 Difference]: Without dead ends: 12787 [2025-01-09 06:57:36,449 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-01-09 06:57:36,450 INFO L435 NwaCegarLoop]: 19175 mSDtfsCounter, 0 mSDsluCounter, 38340 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57515 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:57:36,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57515 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:57:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12787 states. [2025-01-09 06:57:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12787 to 12787. [2025-01-09 06:57:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12787 states, 12786 states have (on average 1.5001564210855622) internal successors, (19181), 12786 states have internal predecessors, (19181), 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-01-09 06:57:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 19181 transitions. [2025-01-09 06:57:36,649 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 19181 transitions. Word has length 338 [2025-01-09 06:57:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:57:36,650 INFO L471 AbstractCegarLoop]: Abstraction has 12787 states and 19181 transitions. [2025-01-09 06:57:36,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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-01-09 06:57:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 19181 transitions. [2025-01-09 06:57:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-09 06:57:36,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:36,653 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] [2025-01-09 06:57:36,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:57:36,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:36,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 567061705, now seen corresponding path program 1 times [2025-01-09 06:57:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140943212] [2025-01-09 06:57:36,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:36,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-09 06:57:37,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-09 06:57:37,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:37,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140943212] [2025-01-09 06:57:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140943212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:57:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608031978] [2025-01-09 06:57:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:57:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:38,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:57:38,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:57:38,884 INFO L87 Difference]: Start difference. First operand 12787 states and 19181 transitions. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-01-09 06:57:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:57:39,569 INFO L93 Difference]: Finished difference Result 25933 states and 38897 transitions. [2025-01-09 06:57:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:57:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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 339 [2025-01-09 06:57:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:57:39,591 INFO L225 Difference]: With dead ends: 25933 [2025-01-09 06:57:39,592 INFO L226 Difference]: Without dead ends: 13304 [2025-01-09 06:57:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:57:39,608 INFO L435 NwaCegarLoop]: 19110 mSDtfsCounter, 21031 mSDsluCounter, 57332 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21031 SdHoareTripleChecker+Valid, 76442 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:57:39,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21031 Valid, 76442 Invalid, 266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:57:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13304 states. [2025-01-09 06:57:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13304 to 13285. [2025-01-09 06:57:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13285 states, 13284 states have (on average 1.500075278530563) internal successors, (19927), 13284 states have internal predecessors, (19927), 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-01-09 06:57:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 19927 transitions. [2025-01-09 06:57:39,824 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 19927 transitions. Word has length 339 [2025-01-09 06:57:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:57:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 13285 states and 19927 transitions. [2025-01-09 06:57:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-01-09 06:57:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 19927 transitions. [2025-01-09 06:57:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 06:57:39,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:39,830 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] [2025-01-09 06:57:39,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:57:39,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:39,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1307932630, now seen corresponding path program 1 times [2025-01-09 06:57:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738104803] [2025-01-09 06:57:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:39,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 06:57:40,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 06:57:40,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:40,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:41,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738104803] [2025-01-09 06:57:41,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738104803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:41,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:41,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:57:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190803257] [2025-01-09 06:57:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:41,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:57:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:41,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:57:41,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:57:41,444 INFO L87 Difference]: Start difference. First operand 13285 states and 19927 transitions. Second operand has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 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-01-09 06:57:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:57:42,219 INFO L93 Difference]: Finished difference Result 25935 states and 38899 transitions. [2025-01-09 06:57:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:57:42,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 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 340 [2025-01-09 06:57:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:57:42,242 INFO L225 Difference]: With dead ends: 25935 [2025-01-09 06:57:42,243 INFO L226 Difference]: Without dead ends: 13306 [2025-01-09 06:57:42,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:57:42,258 INFO L435 NwaCegarLoop]: 19109 mSDtfsCounter, 21034 mSDsluCounter, 95541 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21034 SdHoareTripleChecker+Valid, 114650 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:57:42,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21034 Valid, 114650 Invalid, 412 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:57:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2025-01-09 06:57:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13288. [2025-01-09 06:57:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13288 states, 13287 states have (on average 1.500037630766915) internal successors, (19931), 13287 states have internal predecessors, (19931), 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-01-09 06:57:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 19931 transitions. [2025-01-09 06:57:42,462 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 19931 transitions. Word has length 340 [2025-01-09 06:57:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:57:42,463 INFO L471 AbstractCegarLoop]: Abstraction has 13288 states and 19931 transitions. [2025-01-09 06:57:42,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 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-01-09 06:57:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 19931 transitions. [2025-01-09 06:57:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 06:57:42,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:42,467 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] [2025-01-09 06:57:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:57:42,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2084412986, now seen corresponding path program 1 times [2025-01-09 06:57:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990167057] [2025-01-09 06:57:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:42,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 06:57:42,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 06:57:42,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:42,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990167057] [2025-01-09 06:57:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990167057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:57:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670486694] [2025-01-09 06:57:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:57:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:44,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:57:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:57:44,288 INFO L87 Difference]: Start difference. First operand 13288 states and 19931 transitions. Second operand has 9 states, 9 states have (on average 37.888888888888886) internal successors, (341), 9 states have internal predecessors, (341), 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-01-09 06:57:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:57:45,251 INFO L93 Difference]: Finished difference Result 25935 states and 38898 transitions. [2025-01-09 06:57:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:57:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.888888888888886) internal successors, (341), 9 states have internal predecessors, (341), 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 341 [2025-01-09 06:57:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:57:45,272 INFO L225 Difference]: With dead ends: 25935 [2025-01-09 06:57:45,272 INFO L226 Difference]: Without dead ends: 13306 [2025-01-09 06:57:45,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:57:45,287 INFO L435 NwaCegarLoop]: 19095 mSDtfsCounter, 21028 mSDsluCounter, 114570 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21028 SdHoareTripleChecker+Valid, 133665 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:57:45,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21028 Valid, 133665 Invalid, 575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:57:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2025-01-09 06:57:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13292. [2025-01-09 06:57:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13292 states, 13291 states have (on average 1.4999623805582725) internal successors, (19936), 13291 states have internal predecessors, (19936), 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-01-09 06:57:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 19936 transitions. [2025-01-09 06:57:45,456 INFO L78 Accepts]: Start accepts. Automaton has 13292 states and 19936 transitions. Word has length 341 [2025-01-09 06:57:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:57:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 13292 states and 19936 transitions. [2025-01-09 06:57:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.888888888888886) internal successors, (341), 9 states have internal predecessors, (341), 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-01-09 06:57:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13292 states and 19936 transitions. [2025-01-09 06:57:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 06:57:45,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:57:45,459 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] [2025-01-09 06:57:45,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:57:45,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:57:45,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:57:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1372254133, now seen corresponding path program 1 times [2025-01-09 06:57:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:57:45,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120213266] [2025-01-09 06:57:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:57:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:57:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 06:57:46,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 06:57:46,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:57:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:57:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:57:47,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:57:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120213266] [2025-01-09 06:57:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120213266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:57:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:57:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:57:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104621796] [2025-01-09 06:57:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:57:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:57:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:57:47,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:57:47,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:57:47,204 INFO L87 Difference]: Start difference. First operand 13292 states and 19936 transitions. Second operand has 8 states, 8 states have (on average 42.75) internal successors, (342), 8 states have internal predecessors, (342), 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)