./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal44.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.cal44.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 0b9efbe1f2eb9012cfe4baaf4c265c14279b62a6e79060d67076e85c09a3114f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:53:28,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:53:28,605 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:53:28,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:53:28,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:53:28,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:53:28,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:53:28,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:53:28,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:53:28,636 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:53:28,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:53:28,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:53:28,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:53:28,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:53:28,637 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:53:28,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:53:28,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:53:28,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:53:28,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:53:28,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:28,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:28,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:53:28,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:53:28,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:53:28,640 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 -> 0b9efbe1f2eb9012cfe4baaf4c265c14279b62a6e79060d67076e85c09a3114f [2025-01-09 06:53:28,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:53:28,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:53:28,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:53:28,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:53:28,979 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:53:28,981 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.cal44.c [2025-01-09 06:53:30,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912d06636/2d10299f1d0a4caba8ef3a30f23f32cf/FLAGec28bdc5a [2025-01-09 06:53:30,747 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:53:30,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal44.c [2025-01-09 06:53:30,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912d06636/2d10299f1d0a4caba8ef3a30f23f32cf/FLAGec28bdc5a [2025-01-09 06:53:30,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912d06636/2d10299f1d0a4caba8ef3a30f23f32cf [2025-01-09 06:53:30,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:53:30,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:53:30,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:53:30,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:53:30,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:53:30,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:53:30" (1/1) ... [2025-01-09 06:53:30,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4017ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:30, skipping insertion in model container [2025-01-09 06:53:30,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:53:30" (1/1) ... [2025-01-09 06:53:30,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:53:31,171 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.cal44.c[1245,1258] [2025-01-09 06:53:32,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:53:32,145 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:53:32,153 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.cal44.c[1245,1258] [2025-01-09 06:53:32,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:53:32,817 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:53:32,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32 WrapperNode [2025-01-09 06:53:32,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:53:32,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:53:32,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:53:32,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:53:32,826 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:53:32" (1/1) ... [2025-01-09 06:53:33,114 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:53:32" (1/1) ... [2025-01-09 06:53:35,661 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36498 [2025-01-09 06:53:35,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:53:35,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:53:35,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:53:35,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:53:35,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:35,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:36,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:37,024 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:53:37,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:37,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:37,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:37,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:37,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:38,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:38,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:39,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:53:39,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:53:39,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:53:39,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:53:39,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (1/1) ... [2025-01-09 06:53:39,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:53:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:53:39,056 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:53:39,059 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:53:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:53:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:53:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:53:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:53:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:53:40,332 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:53:40,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:54:38,305 INFO L? ?]: Removed 20185 outVars from TransFormulas that were not future-live. [2025-01-09 06:54:38,305 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:54:38,399 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:54:38,399 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:54:38,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:38 BoogieIcfgContainer [2025-01-09 06:54:38,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:54:38,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:54:38,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:54:38,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:54:38,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:53:30" (1/3) ... [2025-01-09 06:54:38,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577df4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:38, skipping insertion in model container [2025-01-09 06:54:38,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:53:32" (2/3) ... [2025-01-09 06:54:38,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577df4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:54:38, skipping insertion in model container [2025-01-09 06:54:38,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:54:38" (3/3) ... [2025-01-09 06:54:38,406 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal44.c [2025-01-09 06:54:38,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:54:38,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal44.c that has 1 procedures, 12510 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:54:38,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:54:38,609 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;@3ac73a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:54:38,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:54:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 12510 states, 12508 states have (on average 1.5003997441637351) internal successors, (18767), 12509 states have internal predecessors, (18767), 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:54:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 06:54:38,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:38,652 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] [2025-01-09 06:54:38,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1346864906, now seen corresponding path program 1 times [2025-01-09 06:54:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297254616] [2025-01-09 06:54:38,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 06:54:39,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 06:54:39,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:39,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:40,220 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:54:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297254616] [2025-01-09 06:54:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297254616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235206000] [2025-01-09 06:54:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:40,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:40,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:40,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:40,283 INFO L87 Difference]: Start difference. First operand has 12510 states, 12508 states have (on average 1.5003997441637351) internal successors, (18767), 12509 states have internal predecessors, (18767), 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 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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:54:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:40,805 INFO L93 Difference]: Finished difference Result 24869 states and 37311 transitions. [2025-01-09 06:54:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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 201 [2025-01-09 06:54:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:40,862 INFO L225 Difference]: With dead ends: 24869 [2025-01-09 06:54:40,863 INFO L226 Difference]: Without dead ends: 12509 [2025-01-09 06:54:40,886 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:54:40,888 INFO L435 NwaCegarLoop]: 18761 mSDtfsCounter, 0 mSDsluCounter, 37516 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56277 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:54:40,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56277 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:54:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12509 states. [2025-01-09 06:54:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12509 to 12509. [2025-01-09 06:54:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12509 states, 12508 states have (on average 1.5002398464982412) internal successors, (18765), 12508 states have internal predecessors, (18765), 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:54:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12509 states to 12509 states and 18765 transitions. [2025-01-09 06:54:41,198 INFO L78 Accepts]: Start accepts. Automaton has 12509 states and 18765 transitions. Word has length 201 [2025-01-09 06:54:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:41,201 INFO L471 AbstractCegarLoop]: Abstraction has 12509 states and 18765 transitions. [2025-01-09 06:54:41,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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:54:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12509 states and 18765 transitions. [2025-01-09 06:54:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 06:54:41,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:41,206 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] [2025-01-09 06:54:41,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:54:41,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1198557301, now seen corresponding path program 1 times [2025-01-09 06:54:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178953390] [2025-01-09 06:54:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:41,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 06:54:41,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 06:54:41,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:41,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:41,753 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:54:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178953390] [2025-01-09 06:54:41,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178953390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600505700] [2025-01-09 06:54:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:41,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:41,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:41,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:41,758 INFO L87 Difference]: Start difference. First operand 12509 states and 18765 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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:54:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:42,150 INFO L93 Difference]: Finished difference Result 24870 states and 37309 transitions. [2025-01-09 06:54:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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 202 [2025-01-09 06:54:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:42,195 INFO L225 Difference]: With dead ends: 24870 [2025-01-09 06:54:42,196 INFO L226 Difference]: Without dead ends: 12511 [2025-01-09 06:54:42,210 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:54:42,211 INFO L435 NwaCegarLoop]: 18761 mSDtfsCounter, 0 mSDsluCounter, 37512 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56273 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:54:42,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56273 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:54:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2025-01-09 06:54:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 12511. [2025-01-09 06:54:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12511 states, 12510 states have (on average 1.5001598721023182) internal successors, (18767), 12510 states have internal predecessors, (18767), 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:54:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12511 states to 12511 states and 18767 transitions. [2025-01-09 06:54:42,412 INFO L78 Accepts]: Start accepts. Automaton has 12511 states and 18767 transitions. Word has length 202 [2025-01-09 06:54:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 12511 states and 18767 transitions. [2025-01-09 06:54:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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:54:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 12511 states and 18767 transitions. [2025-01-09 06:54:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 06:54:42,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:42,417 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] [2025-01-09 06:54:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:54:42,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1697573295, now seen corresponding path program 1 times [2025-01-09 06:54:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134363333] [2025-01-09 06:54:42,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:42,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 06:54:42,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 06:54:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:42,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:43,174 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:54:43,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134363333] [2025-01-09 06:54:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134363333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:43,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:43,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976905142] [2025-01-09 06:54:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:43,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:43,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:43,177 INFO L87 Difference]: Start difference. First operand 12511 states and 18767 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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:54:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:43,436 INFO L93 Difference]: Finished difference Result 24872 states and 37310 transitions. [2025-01-09 06:54:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:43,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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 203 [2025-01-09 06:54:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:43,457 INFO L225 Difference]: With dead ends: 24872 [2025-01-09 06:54:43,458 INFO L226 Difference]: Without dead ends: 12511 [2025-01-09 06:54:43,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:43,475 INFO L435 NwaCegarLoop]: 18757 mSDtfsCounter, 125 mSDsluCounter, 37388 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 56145 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:43,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 56145 Invalid, 13 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:54:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2025-01-09 06:54:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 12511. [2025-01-09 06:54:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12511 states, 12510 states have (on average 1.500079936051159) internal successors, (18766), 12510 states have internal predecessors, (18766), 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:54:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12511 states to 12511 states and 18766 transitions. [2025-01-09 06:54:43,676 INFO L78 Accepts]: Start accepts. Automaton has 12511 states and 18766 transitions. Word has length 203 [2025-01-09 06:54:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:43,677 INFO L471 AbstractCegarLoop]: Abstraction has 12511 states and 18766 transitions. [2025-01-09 06:54:43,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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:54:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 12511 states and 18766 transitions. [2025-01-09 06:54:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 06:54:43,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:43,678 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] [2025-01-09 06:54:43,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:54:43,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:43,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1830435406, now seen corresponding path program 1 times [2025-01-09 06:54:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707629281] [2025-01-09 06:54:43,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:43,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 06:54:43,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 06:54:43,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:43,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:44,253 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:54:44,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707629281] [2025-01-09 06:54:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707629281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256278691] [2025-01-09 06:54:44,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:44,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:44,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:44,255 INFO L87 Difference]: Start difference. First operand 12511 states and 18766 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:54:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:45,287 INFO L93 Difference]: Finished difference Result 36989 states and 55486 transitions. [2025-01-09 06:54:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:54:45,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 204 [2025-01-09 06:54:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:45,306 INFO L225 Difference]: With dead ends: 36989 [2025-01-09 06:54:45,307 INFO L226 Difference]: Without dead ends: 12511 [2025-01-09 06:54:45,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:45,330 INFO L435 NwaCegarLoop]: 18757 mSDtfsCounter, 17990 mSDsluCounter, 36864 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17990 SdHoareTripleChecker+Valid, 55621 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:45,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17990 Valid, 55621 Invalid, 1019 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:54:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2025-01-09 06:54:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 12511. [2025-01-09 06:54:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12511 states, 12510 states have (on average 1.5) internal successors, (18765), 12510 states have internal predecessors, (18765), 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:54:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12511 states to 12511 states and 18765 transitions. [2025-01-09 06:54:45,509 INFO L78 Accepts]: Start accepts. Automaton has 12511 states and 18765 transitions. Word has length 204 [2025-01-09 06:54:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:45,509 INFO L471 AbstractCegarLoop]: Abstraction has 12511 states and 18765 transitions. [2025-01-09 06:54:45,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:54:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12511 states and 18765 transitions. [2025-01-09 06:54:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 06:54:45,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:45,511 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] [2025-01-09 06:54:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:54:45,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1192270808, now seen corresponding path program 1 times [2025-01-09 06:54:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867253070] [2025-01-09 06:54:45,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:45,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 06:54:45,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 06:54:45,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:45,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:46,089 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:54:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867253070] [2025-01-09 06:54:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867253070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:54:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390431632] [2025-01-09 06:54:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:54:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:54:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:46,091 INFO L87 Difference]: Start difference. First operand 12511 states and 18765 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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:54:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:47,320 INFO L93 Difference]: Finished difference Result 24876 states and 37311 transitions. [2025-01-09 06:54:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:54:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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 205 [2025-01-09 06:54:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:47,337 INFO L225 Difference]: With dead ends: 24876 [2025-01-09 06:54:47,338 INFO L226 Difference]: Without dead ends: 12515 [2025-01-09 06:54:47,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:54:47,348 INFO L435 NwaCegarLoop]: 18108 mSDtfsCounter, 18759 mSDsluCounter, 36213 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18759 SdHoareTripleChecker+Valid, 54321 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:47,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18759 Valid, 54321 Invalid, 1963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:54:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12515 states. [2025-01-09 06:54:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12515 to 12514. [2025-01-09 06:54:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12514 states, 12513 states have (on average 1.4998801246703428) internal successors, (18768), 12513 states have internal predecessors, (18768), 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:54:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12514 states to 12514 states and 18768 transitions. [2025-01-09 06:54:47,509 INFO L78 Accepts]: Start accepts. Automaton has 12514 states and 18768 transitions. Word has length 205 [2025-01-09 06:54:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 12514 states and 18768 transitions. [2025-01-09 06:54:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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:54:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 12514 states and 18768 transitions. [2025-01-09 06:54:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 06:54:47,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:47,514 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] [2025-01-09 06:54:47,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:54:47,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1021520529, now seen corresponding path program 1 times [2025-01-09 06:54:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014153373] [2025-01-09 06:54:47,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:47,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 06:54:47,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 06:54:47,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:47,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:48,673 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:54:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014153373] [2025-01-09 06:54:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014153373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:54:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891859223] [2025-01-09 06:54:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:54:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:54:48,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:54:48,677 INFO L87 Difference]: Start difference. First operand 12514 states and 18768 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 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:54:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:49,288 INFO L93 Difference]: Finished difference Result 25134 states and 37688 transitions. [2025-01-09 06:54:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:54:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 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 206 [2025-01-09 06:54:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:49,309 INFO L225 Difference]: With dead ends: 25134 [2025-01-09 06:54:49,309 INFO L226 Difference]: Without dead ends: 12770 [2025-01-09 06:54:49,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:54:49,322 INFO L435 NwaCegarLoop]: 18694 mSDtfsCounter, 19554 mSDsluCounter, 56084 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19554 SdHoareTripleChecker+Valid, 74778 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:54:49,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19554 Valid, 74778 Invalid, 266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:54:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2025-01-09 06:54:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 12751. [2025-01-09 06:54:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12751 states, 12750 states have (on average 1.4995294117647058) internal successors, (19119), 12750 states have internal predecessors, (19119), 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:54:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12751 states to 12751 states and 19119 transitions. [2025-01-09 06:54:49,467 INFO L78 Accepts]: Start accepts. Automaton has 12751 states and 19119 transitions. Word has length 206 [2025-01-09 06:54:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:49,469 INFO L471 AbstractCegarLoop]: Abstraction has 12751 states and 19119 transitions. [2025-01-09 06:54:49,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 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:54:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12751 states and 19119 transitions. [2025-01-09 06:54:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 06:54:49,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:49,471 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] [2025-01-09 06:54:49,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:54:49,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:49,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1783713894, now seen corresponding path program 1 times [2025-01-09 06:54:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449421520] [2025-01-09 06:54:49,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:49,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 06:54:49,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 06:54:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:49,970 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:54:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449421520] [2025-01-09 06:54:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449421520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:54:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57283367] [2025-01-09 06:54:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:49,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:54:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:54:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:54:49,972 INFO L87 Difference]: Start difference. First operand 12751 states and 19119 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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:54:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:50,653 INFO L93 Difference]: Finished difference Result 25334 states and 37985 transitions. [2025-01-09 06:54:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:54:50,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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 207 [2025-01-09 06:54:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:50,692 INFO L225 Difference]: With dead ends: 25334 [2025-01-09 06:54:50,699 INFO L226 Difference]: Without dead ends: 12751 [2025-01-09 06:54:50,719 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:54:50,720 INFO L435 NwaCegarLoop]: 18754 mSDtfsCounter, 30 mSDsluCounter, 36860 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 55614 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:50,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 55614 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:54:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12751 states. [2025-01-09 06:54:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12751 to 12751. [2025-01-09 06:54:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12751 states, 12750 states have (on average 1.499372549019608) internal successors, (19117), 12750 states have internal predecessors, (19117), 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:54:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12751 states to 12751 states and 19117 transitions. [2025-01-09 06:54:50,841 INFO L78 Accepts]: Start accepts. Automaton has 12751 states and 19117 transitions. Word has length 207 [2025-01-09 06:54:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:50,841 INFO L471 AbstractCegarLoop]: Abstraction has 12751 states and 19117 transitions. [2025-01-09 06:54:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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:54:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 12751 states and 19117 transitions. [2025-01-09 06:54:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 06:54:50,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:50,843 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] [2025-01-09 06:54:50,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:54:50,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:50,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1974860026, now seen corresponding path program 1 times [2025-01-09 06:54:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:50,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845199150] [2025-01-09 06:54:50,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:50,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 06:54:51,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 06:54:51,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:51,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:54:51,337 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:54:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:54:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845199150] [2025-01-09 06:54:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845199150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:54:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:54:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:54:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795135458] [2025-01-09 06:54:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:54:51,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:54:51,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:54:51,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:54:51,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:54:51,339 INFO L87 Difference]: Start difference. First operand 12751 states and 19117 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:54:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:54:51,487 INFO L93 Difference]: Finished difference Result 25189 states and 37770 transitions. [2025-01-09 06:54:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:54:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2025-01-09 06:54:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:54:51,518 INFO L225 Difference]: With dead ends: 25189 [2025-01-09 06:54:51,518 INFO L226 Difference]: Without dead ends: 12751 [2025-01-09 06:54:51,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:54:51,532 INFO L435 NwaCegarLoop]: 18756 mSDtfsCounter, 2 mSDsluCounter, 18752 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37508 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:54:51,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37508 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:54:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12751 states. [2025-01-09 06:54:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12751 to 12751. [2025-01-09 06:54:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12751 states, 12750 states have (on average 1.4992156862745099) internal successors, (19115), 12750 states have internal predecessors, (19115), 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:54:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12751 states to 12751 states and 19115 transitions. [2025-01-09 06:54:51,713 INFO L78 Accepts]: Start accepts. Automaton has 12751 states and 19115 transitions. Word has length 208 [2025-01-09 06:54:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:54:51,714 INFO L471 AbstractCegarLoop]: Abstraction has 12751 states and 19115 transitions. [2025-01-09 06:54:51,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:54:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 12751 states and 19115 transitions. [2025-01-09 06:54:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 06:54:51,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:54:51,716 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] [2025-01-09 06:54:51,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:54:51,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:54:51,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:54:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash 789864672, now seen corresponding path program 1 times [2025-01-09 06:54:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:54:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356319709] [2025-01-09 06:54:51,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:54:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:54:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 06:54:51,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 06:54:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:54:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat