./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal28.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.cal28.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 a7fbb529a976040c89cd70a0b8d5b61be73ce36c7349c078c8ffac4cad389477 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:51:19,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:51:19,526 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:51:19,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:51:19,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:51:19,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:51:19,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:51:19,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:51:19,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:51:19,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:51:19,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:51:19,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:51:19,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:51:19,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:51:19,549 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:51:19,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:51:19,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:51:19,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:51:19,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:51:19,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:51:19,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:51:19,555 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 -> a7fbb529a976040c89cd70a0b8d5b61be73ce36c7349c078c8ffac4cad389477 [2025-01-09 06:51:19,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:51:19,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:51:19,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:51:19,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:51:19,809 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:51:19,810 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.cal28.c [2025-01-09 06:51:21,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d55b0861/5cfc96cd57904fd0ada3ca5c81151b59/FLAG779e77743 [2025-01-09 06:51:21,452 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:51:21,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal28.c [2025-01-09 06:51:21,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d55b0861/5cfc96cd57904fd0ada3ca5c81151b59/FLAG779e77743 [2025-01-09 06:51:21,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d55b0861/5cfc96cd57904fd0ada3ca5c81151b59 [2025-01-09 06:51:21,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:51:21,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:51:21,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:51:21,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:51:21,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:51:21,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:51:21" (1/1) ... [2025-01-09 06:51:21,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:21, skipping insertion in model container [2025-01-09 06:51:21,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:51:21" (1/1) ... [2025-01-09 06:51:21,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:51:21,821 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.cal28.c[1245,1258] [2025-01-09 06:51:22,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:51:22,608 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:51:22,619 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.cal28.c[1245,1258] [2025-01-09 06:51:23,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:51:23,372 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:51:23,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23 WrapperNode [2025-01-09 06:51:23,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:51:23,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:51:23,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:51:23,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:51:23,380 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:51:23" (1/1) ... [2025-01-09 06:51:23,517 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:51:23" (1/1) ... [2025-01-09 06:51:25,844 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35490 [2025-01-09 06:51:25,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:51:25,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:51:25,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:51:25,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:51:25,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:25,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:26,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:27,258 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:51:27,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:27,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:28,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:28,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:28,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:28,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:28,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:29,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:51:29,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:51:29,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:51:29,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:51:29,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (1/1) ... [2025-01-09 06:51:29,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:51:29,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:51:29,296 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:51:29,300 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:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:51:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:51:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:51:30,556 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:51:30,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:52:33,855 INFO L? ?]: Removed 19351 outVars from TransFormulas that were not future-live. [2025-01-09 06:52:33,856 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:52:33,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:52:33,949 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:52:33,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:52:33 BoogieIcfgContainer [2025-01-09 06:52:33,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:52:33,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:52:33,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:52:33,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:52:33,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:51:21" (1/3) ... [2025-01-09 06:52:33,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cf896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:52:33, skipping insertion in model container [2025-01-09 06:52:33,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:23" (2/3) ... [2025-01-09 06:52:33,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cf896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:52:33, skipping insertion in model container [2025-01-09 06:52:33,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:52:33" (3/3) ... [2025-01-09 06:52:33,958 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal28.c [2025-01-09 06:52:33,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:52:33,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal28.c that has 1 procedures, 12309 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:52:34,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:52:34,157 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42dd55eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:52:34,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:52:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 12309 states, 12307 states have (on average 1.5005281547087024) internal successors, (18467), 12308 states have internal predecessors, (18467), 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:52:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 06:52:34,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:34,195 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] [2025-01-09 06:52:34,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1785414385, now seen corresponding path program 1 times [2025-01-09 06:52:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034240348] [2025-01-09 06:52:34,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 06:52:34,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 06:52:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:35,116 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:52:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034240348] [2025-01-09 06:52:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034240348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:52:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763745771] [2025-01-09 06:52:35,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:35,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:52:35,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:35,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:52:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:52:35,162 INFO L87 Difference]: Start difference. First operand has 12309 states, 12307 states have (on average 1.5005281547087024) internal successors, (18467), 12308 states have internal predecessors, (18467), 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 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:52:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:52:35,554 INFO L93 Difference]: Finished difference Result 24527 states and 36801 transitions. [2025-01-09 06:52:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:52:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-01-09 06:52:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:52:35,613 INFO L225 Difference]: With dead ends: 24527 [2025-01-09 06:52:35,615 INFO L226 Difference]: Without dead ends: 12308 [2025-01-09 06:52:35,636 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:52:35,640 INFO L435 NwaCegarLoop]: 18461 mSDtfsCounter, 0 mSDsluCounter, 36916 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55377 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:52:35,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55377 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:52:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12308 states. [2025-01-09 06:52:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12308 to 12308. [2025-01-09 06:52:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12308 states, 12307 states have (on average 1.5003656455675631) internal successors, (18465), 12307 states have internal predecessors, (18465), 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:52:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 18465 transitions. [2025-01-09 06:52:35,955 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 18465 transitions. Word has length 115 [2025-01-09 06:52:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:52:35,956 INFO L471 AbstractCegarLoop]: Abstraction has 12308 states and 18465 transitions. [2025-01-09 06:52:35,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:52:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 18465 transitions. [2025-01-09 06:52:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 06:52:35,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:35,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] [2025-01-09 06:52:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:52:35,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -485033045, now seen corresponding path program 1 times [2025-01-09 06:52:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485214468] [2025-01-09 06:52:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:36,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 06:52:36,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 06:52:36,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:36,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:36,336 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:52:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485214468] [2025-01-09 06:52:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485214468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:52:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127836248] [2025-01-09 06:52:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:36,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:52:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:36,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:52:36,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:52:36,339 INFO L87 Difference]: Start difference. First operand 12308 states and 18465 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:52:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:52:36,607 INFO L93 Difference]: Finished difference Result 24528 states and 36799 transitions. [2025-01-09 06:52:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:52:36,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 116 [2025-01-09 06:52:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:52:36,651 INFO L225 Difference]: With dead ends: 24528 [2025-01-09 06:52:36,652 INFO L226 Difference]: Without dead ends: 12310 [2025-01-09 06:52:36,667 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:52:36,667 INFO L435 NwaCegarLoop]: 18461 mSDtfsCounter, 0 mSDsluCounter, 36912 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55373 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:52:36,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55373 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:52:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12310 states. [2025-01-09 06:52:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12310 to 12310. [2025-01-09 06:52:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12310 states, 12309 states have (on average 1.5002843447883663) internal successors, (18467), 12309 states have internal predecessors, (18467), 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:52:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12310 states to 12310 states and 18467 transitions. [2025-01-09 06:52:36,883 INFO L78 Accepts]: Start accepts. Automaton has 12310 states and 18467 transitions. Word has length 116 [2025-01-09 06:52:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:52:36,884 INFO L471 AbstractCegarLoop]: Abstraction has 12310 states and 18467 transitions. [2025-01-09 06:52:36,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:52:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 12310 states and 18467 transitions. [2025-01-09 06:52:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 06:52:36,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:36,890 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] [2025-01-09 06:52:36,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:52:36,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1045879562, now seen corresponding path program 1 times [2025-01-09 06:52:36,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:36,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743491321] [2025-01-09 06:52:36,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:36,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 06:52:37,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 06:52:37,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:37,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:37,661 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:52:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743491321] [2025-01-09 06:52:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743491321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:52:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699867896] [2025-01-09 06:52:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:37,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:52:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:37,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:52:37,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:52:37,665 INFO L87 Difference]: Start difference. First operand 12310 states and 18467 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:52:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:52:38,365 INFO L93 Difference]: Finished difference Result 24671 states and 37007 transitions. [2025-01-09 06:52:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:52:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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 117 [2025-01-09 06:52:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:52:38,385 INFO L225 Difference]: With dead ends: 24671 [2025-01-09 06:52:38,385 INFO L226 Difference]: Without dead ends: 12451 [2025-01-09 06:52:38,400 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:52:38,401 INFO L435 NwaCegarLoop]: 18404 mSDtfsCounter, 18847 mSDsluCounter, 55214 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18847 SdHoareTripleChecker+Valid, 73618 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:52:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18847 Valid, 73618 Invalid, 234 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:52:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12451 states. [2025-01-09 06:52:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12451 to 12432. [2025-01-09 06:52:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12432 states, 12431 states have (on average 1.500201110127906) internal successors, (18649), 12431 states have internal predecessors, (18649), 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:52:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12432 states to 12432 states and 18649 transitions. [2025-01-09 06:52:38,606 INFO L78 Accepts]: Start accepts. Automaton has 12432 states and 18649 transitions. Word has length 117 [2025-01-09 06:52:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:52:38,606 INFO L471 AbstractCegarLoop]: Abstraction has 12432 states and 18649 transitions. [2025-01-09 06:52:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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:52:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12432 states and 18649 transitions. [2025-01-09 06:52:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 06:52:38,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:38,608 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] [2025-01-09 06:52:38,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:52:38,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:38,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1028584430, now seen corresponding path program 1 times [2025-01-09 06:52:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214273693] [2025-01-09 06:52:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:38,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 06:52:38,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 06:52:38,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:38,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:39,120 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:52:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214273693] [2025-01-09 06:52:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214273693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:52:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792142557] [2025-01-09 06:52:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:39,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:52:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:52:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:52:39,122 INFO L87 Difference]: Start difference. First operand 12432 states and 18649 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:52:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:52:39,796 INFO L93 Difference]: Finished difference Result 24673 states and 37009 transitions. [2025-01-09 06:52:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:52:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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 118 [2025-01-09 06:52:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:52:39,817 INFO L225 Difference]: With dead ends: 24673 [2025-01-09 06:52:39,817 INFO L226 Difference]: Without dead ends: 12453 [2025-01-09 06:52:39,833 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:52:39,834 INFO L435 NwaCegarLoop]: 18403 mSDtfsCounter, 18850 mSDsluCounter, 92011 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18850 SdHoareTripleChecker+Valid, 110414 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:52:39,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18850 Valid, 110414 Invalid, 364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:52:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12453 states. [2025-01-09 06:52:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12453 to 12435. [2025-01-09 06:52:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12435 states, 12434 states have (on average 1.5001608492842207) internal successors, (18653), 12434 states have internal predecessors, (18653), 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:52:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12435 states to 12435 states and 18653 transitions. [2025-01-09 06:52:40,036 INFO L78 Accepts]: Start accepts. Automaton has 12435 states and 18653 transitions. Word has length 118 [2025-01-09 06:52:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:52:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 12435 states and 18653 transitions. [2025-01-09 06:52:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:52:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12435 states and 18653 transitions. [2025-01-09 06:52:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:52:40,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:40,038 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] [2025-01-09 06:52:40,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:52:40,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1501999257, now seen corresponding path program 1 times [2025-01-09 06:52:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650184459] [2025-01-09 06:52:40,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:52:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:52:40,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:40,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:40,933 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:52:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:40,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650184459] [2025-01-09 06:52:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650184459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:40,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:52:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722088151] [2025-01-09 06:52:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:52:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:52:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:52:40,935 INFO L87 Difference]: Start difference. First operand 12435 states and 18653 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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:52:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:52:41,835 INFO L93 Difference]: Finished difference Result 24673 states and 37008 transitions. [2025-01-09 06:52:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:52:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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 119 [2025-01-09 06:52:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:52:41,854 INFO L225 Difference]: With dead ends: 24673 [2025-01-09 06:52:41,854 INFO L226 Difference]: Without dead ends: 12453 [2025-01-09 06:52:41,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 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:52:41,871 INFO L435 NwaCegarLoop]: 18384 mSDtfsCounter, 18844 mSDsluCounter, 110304 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18844 SdHoareTripleChecker+Valid, 128688 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:52:41,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18844 Valid, 128688 Invalid, 554 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:52:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12453 states. [2025-01-09 06:52:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12453 to 12439. [2025-01-09 06:52:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 12438 states have (on average 1.5000803987779385) internal successors, (18658), 12438 states have internal predecessors, (18658), 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:52:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 18658 transitions. [2025-01-09 06:52:42,068 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 18658 transitions. Word has length 119 [2025-01-09 06:52:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:52:42,068 INFO L471 AbstractCegarLoop]: Abstraction has 12439 states and 18658 transitions. [2025-01-09 06:52:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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:52:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 18658 transitions. [2025-01-09 06:52:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 06:52:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:52:42,070 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] [2025-01-09 06:52:42,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:52:42,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:52:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:52:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2047758191, now seen corresponding path program 1 times [2025-01-09 06:52:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:52:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813466653] [2025-01-09 06:52:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:52:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:52:42,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 06:52:42,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 06:52:42,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:52:42,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:52:42,836 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:52:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:52:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813466653] [2025-01-09 06:52:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813466653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:52:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:52:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:52:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396264576] [2025-01-09 06:52:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:52:42,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:52:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:52:42,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:52:42,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:52:42,837 INFO L87 Difference]: Start difference. First operand 12439 states and 18658 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 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)