./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:46:25,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:46:25,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:46:25,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:46:25,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:46:25,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:46:25,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:46:25,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:46:25,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:46:25,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:46:25,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:46:25,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:46:25,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:46:25,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:25,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:25,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:46:25,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:46:25,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:46:25,385 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 [2025-01-09 04:46:25,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:46:25,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:46:25,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:46:25,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:46:25,628 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:46:25,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:46:26,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8a5c4ca3/481ad2dd4a904bba9363e0043f3a909e/FLAGe98bb8b79 [2025-01-09 04:46:27,251 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:46:27,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:46:27,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8a5c4ca3/481ad2dd4a904bba9363e0043f3a909e/FLAGe98bb8b79 [2025-01-09 04:46:27,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8a5c4ca3/481ad2dd4a904bba9363e0043f3a909e [2025-01-09 04:46:27,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:46:27,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:46:27,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:46:27,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:46:27,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:46:27,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d597279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27, skipping insertion in model container [2025-01-09 04:46:27,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:46:27,486 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/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2025-01-09 04:46:27,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:46:27,543 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:46:27,599 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/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2025-01-09 04:46:27,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:46:27,643 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:46:27,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27 WrapperNode [2025-01-09 04:46:27,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:46:27,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:46:27,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:46:27,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:46:27,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,710 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1021 [2025-01-09 04:46:27,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:46:27,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:46:27,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:46:27,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:46:27,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:46:27,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:46:27,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:46:27,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:46:27,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:46:27,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (1/1) ... [2025-01-09 04:46:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:46:27,793 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 04:46:27,803 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 04:46:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:46:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:46:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:46:27,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:46:27,910 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:46:27,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:46:28,621 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-01-09 04:46:28,621 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:46:28,630 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:46:28,630 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:46:28,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:28 BoogieIcfgContainer [2025-01-09 04:46:28,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:46:28,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:46:28,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:46:28,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:46:28,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:46:27" (1/3) ... [2025-01-09 04:46:28,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a4dadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:28, skipping insertion in model container [2025-01-09 04:46:28,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:27" (2/3) ... [2025-01-09 04:46:28,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a4dadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:28, skipping insertion in model container [2025-01-09 04:46:28,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:28" (3/3) ... [2025-01-09 04:46:28,639 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-01-09 04:46:28,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:46:28,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c that has 1 procedures, 250 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:46:28,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:46:28,713 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;@3d431f9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:46:28,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:46:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 250 states, 248 states have (on average 1.7258064516129032) internal successors, (428), 249 states have internal predecessors, (428), 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 04:46:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:46:28,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:28,727 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] [2025-01-09 04:46:28,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 680840216, now seen corresponding path program 1 times [2025-01-09 04:46:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567415734] [2025-01-09 04:46:28,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:28,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:46:28,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:46:28,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:28,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:29,392 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 04:46:29,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:29,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567415734] [2025-01-09 04:46:29,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567415734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:29,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:29,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494492704] [2025-01-09 04:46:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:46:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:29,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:46:29,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:29,417 INFO L87 Difference]: Start difference. First operand has 250 states, 248 states have (on average 1.7258064516129032) internal successors, (428), 249 states have internal predecessors, (428), 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 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 04:46:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:29,772 INFO L93 Difference]: Finished difference Result 1120 states and 1817 transitions. [2025-01-09 04:46:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:46:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2025-01-09 04:46:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:29,783 INFO L225 Difference]: With dead ends: 1120 [2025-01-09 04:46:29,783 INFO L226 Difference]: Without dead ends: 984 [2025-01-09 04:46:29,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:46:29,787 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 4180 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4180 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:29,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4180 Valid, 3700 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-01-09 04:46:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 382. [2025-01-09 04:46:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 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 04:46:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 571 transitions. [2025-01-09 04:46:29,831 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 571 transitions. Word has length 96 [2025-01-09 04:46:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:29,832 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 571 transitions. [2025-01-09 04:46:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 04:46:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 571 transitions. [2025-01-09 04:46:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:46:29,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:29,834 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] [2025-01-09 04:46:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:46:29,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash -693931319, now seen corresponding path program 1 times [2025-01-09 04:46:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514384984] [2025-01-09 04:46:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:46:29,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:46:29,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:30,173 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 04:46:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514384984] [2025-01-09 04:46:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514384984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794936304] [2025-01-09 04:46:30,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:30,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:46:30,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:30,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:46:30,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:30,175 INFO L87 Difference]: Start difference. First operand 382 states and 571 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 04:46:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:30,448 INFO L93 Difference]: Finished difference Result 1909 states and 2955 transitions. [2025-01-09 04:46:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:46:30,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-01-09 04:46:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:30,453 INFO L225 Difference]: With dead ends: 1909 [2025-01-09 04:46:30,453 INFO L226 Difference]: Without dead ends: 1623 [2025-01-09 04:46:30,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:30,455 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 1585 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:30,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 2466 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-01-09 04:46:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1613. [2025-01-09 04:46:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 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 04:46:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2490 transitions. [2025-01-09 04:46:30,498 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2490 transitions. Word has length 97 [2025-01-09 04:46:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:30,498 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2490 transitions. [2025-01-09 04:46:30,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 04:46:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2490 transitions. [2025-01-09 04:46:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:46:30,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:30,502 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] [2025-01-09 04:46:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:46:30,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:30,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1453946111, now seen corresponding path program 1 times [2025-01-09 04:46:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194703608] [2025-01-09 04:46:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:30,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:46:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:46:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:30,650 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 04:46:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194703608] [2025-01-09 04:46:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194703608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:30,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278422883] [2025-01-09 04:46:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:30,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:30,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:30,654 INFO L87 Difference]: Start difference. First operand 1613 states and 2490 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:30,928 INFO L93 Difference]: Finished difference Result 4341 states and 6773 transitions. [2025-01-09 04:46:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-01-09 04:46:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:30,940 INFO L225 Difference]: With dead ends: 4341 [2025-01-09 04:46:30,940 INFO L226 Difference]: Without dead ends: 2815 [2025-01-09 04:46:30,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:30,947 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1367 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:30,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 344 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2025-01-09 04:46:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2813. [2025-01-09 04:46:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 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 04:46:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4366 transitions. [2025-01-09 04:46:31,009 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4366 transitions. Word has length 98 [2025-01-09 04:46:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:31,009 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 4366 transitions. [2025-01-09 04:46:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4366 transitions. [2025-01-09 04:46:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:46:31,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:31,013 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] [2025-01-09 04:46:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:46:31,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1726044558, now seen corresponding path program 1 times [2025-01-09 04:46:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899437866] [2025-01-09 04:46:31,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:46:31,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:46:31,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:31,145 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 04:46:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899437866] [2025-01-09 04:46:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899437866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214685691] [2025-01-09 04:46:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:31,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:31,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:31,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:31,147 INFO L87 Difference]: Start difference. First operand 2813 states and 4366 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:31,432 INFO L93 Difference]: Finished difference Result 7797 states and 12184 transitions. [2025-01-09 04:46:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-01-09 04:46:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:31,447 INFO L225 Difference]: With dead ends: 7797 [2025-01-09 04:46:31,447 INFO L226 Difference]: Without dead ends: 5101 [2025-01-09 04:46:31,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:31,450 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1329 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:31,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 346 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2025-01-09 04:46:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5099. [2025-01-09 04:46:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 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 04:46:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7925 transitions. [2025-01-09 04:46:31,527 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7925 transitions. Word has length 98 [2025-01-09 04:46:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:31,527 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 7925 transitions. [2025-01-09 04:46:31,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7925 transitions. [2025-01-09 04:46:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:46:31,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:31,530 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] [2025-01-09 04:46:31,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:46:31,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:31,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1050081644, now seen corresponding path program 1 times [2025-01-09 04:46:31,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:31,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528198211] [2025-01-09 04:46:31,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:31,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:46:31,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:46:31,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:31,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:31,633 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 04:46:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528198211] [2025-01-09 04:46:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528198211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:31,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267054288] [2025-01-09 04:46:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:31,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:31,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:31,636 INFO L87 Difference]: Start difference. First operand 5099 states and 7925 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:31,881 INFO L93 Difference]: Finished difference Result 14365 states and 22445 transitions. [2025-01-09 04:46:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:31,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-01-09 04:46:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:31,909 INFO L225 Difference]: With dead ends: 14365 [2025-01-09 04:46:31,909 INFO L226 Difference]: Without dead ends: 9461 [2025-01-09 04:46:31,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:31,918 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1279 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:31,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 359 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2025-01-09 04:46:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 9459. [2025-01-09 04:46:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9459 states, 9458 states have (on average 1.5558257559737787) internal successors, (14715), 9458 states have internal predecessors, (14715), 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 04:46:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9459 states to 9459 states and 14715 transitions. [2025-01-09 04:46:32,139 INFO L78 Accepts]: Start accepts. Automaton has 9459 states and 14715 transitions. Word has length 98 [2025-01-09 04:46:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:32,139 INFO L471 AbstractCegarLoop]: Abstraction has 9459 states and 14715 transitions. [2025-01-09 04:46:32,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 9459 states and 14715 transitions. [2025-01-09 04:46:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:46:32,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:32,142 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] [2025-01-09 04:46:32,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:46:32,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1204309923, now seen corresponding path program 1 times [2025-01-09 04:46:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000055203] [2025-01-09 04:46:32,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:32,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:46:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:46:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:32,242 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 04:46:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000055203] [2025-01-09 04:46:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000055203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:32,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144029634] [2025-01-09 04:46:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:32,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:32,244 INFO L87 Difference]: Start difference. First operand 9459 states and 14715 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:32,520 INFO L93 Difference]: Finished difference Result 27518 states and 42910 transitions. [2025-01-09 04:46:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-01-09 04:46:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:32,560 INFO L225 Difference]: With dead ends: 27518 [2025-01-09 04:46:32,560 INFO L226 Difference]: Without dead ends: 18213 [2025-01-09 04:46:32,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:32,576 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1285 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:32,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 348 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18213 states. [2025-01-09 04:46:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18213 to 18211. [2025-01-09 04:46:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18211 states, 18210 states have (on average 1.5523887973640857) internal successors, (28269), 18210 states have internal predecessors, (28269), 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 04:46:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18211 states to 18211 states and 28269 transitions. [2025-01-09 04:46:32,893 INFO L78 Accepts]: Start accepts. Automaton has 18211 states and 28269 transitions. Word has length 98 [2025-01-09 04:46:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 18211 states and 28269 transitions. [2025-01-09 04:46:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18211 states and 28269 transitions. [2025-01-09 04:46:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:46:32,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:32,897 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] [2025-01-09 04:46:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:46:32,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1872069296, now seen corresponding path program 1 times [2025-01-09 04:46:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123093021] [2025-01-09 04:46:32,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:32,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:46:32,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:46:32,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:32,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:33,011 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 04:46:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123093021] [2025-01-09 04:46:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123093021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178385951] [2025-01-09 04:46:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:33,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:33,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:33,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:33,013 INFO L87 Difference]: Start difference. First operand 18211 states and 28269 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:33,326 INFO L93 Difference]: Finished difference Result 54168 states and 84194 transitions. [2025-01-09 04:46:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2025-01-09 04:46:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:33,383 INFO L225 Difference]: With dead ends: 54168 [2025-01-09 04:46:33,383 INFO L226 Difference]: Without dead ends: 36021 [2025-01-09 04:46:33,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:33,411 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1371 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:33,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 344 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36021 states. [2025-01-09 04:46:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36021 to 36019. [2025-01-09 04:46:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36019 states, 36018 states have (on average 1.5457271364317842) internal successors, (55674), 36018 states have internal predecessors, (55674), 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 04:46:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36019 states to 36019 states and 55674 transitions. [2025-01-09 04:46:34,018 INFO L78 Accepts]: Start accepts. Automaton has 36019 states and 55674 transitions. Word has length 98 [2025-01-09 04:46:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:34,018 INFO L471 AbstractCegarLoop]: Abstraction has 36019 states and 55674 transitions. [2025-01-09 04:46:34,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 04:46:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36019 states and 55674 transitions. [2025-01-09 04:46:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:46:34,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:34,119 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] [2025-01-09 04:46:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:46:34,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 944001903, now seen corresponding path program 1 times [2025-01-09 04:46:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414914198] [2025-01-09 04:46:34,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:34,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:46:34,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:46:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:34,272 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 04:46:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414914198] [2025-01-09 04:46:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414914198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249114884] [2025-01-09 04:46:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:34,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:34,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:34,274 INFO L87 Difference]: Start difference. First operand 36019 states and 55674 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 04:46:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:34,829 INFO L93 Difference]: Finished difference Result 102359 states and 158350 transitions. [2025-01-09 04:46:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2025-01-09 04:46:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:34,991 INFO L225 Difference]: With dead ends: 102359 [2025-01-09 04:46:34,991 INFO L226 Difference]: Without dead ends: 66420 [2025-01-09 04:46:35,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:35,034 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1404 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:35,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 347 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66420 states. [2025-01-09 04:46:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66420 to 66418. [2025-01-09 04:46:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66418 states, 66417 states have (on average 1.541472815694777) internal successors, (102380), 66417 states have internal predecessors, (102380), 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 04:46:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66418 states to 66418 states and 102380 transitions. [2025-01-09 04:46:35,997 INFO L78 Accepts]: Start accepts. Automaton has 66418 states and 102380 transitions. Word has length 99 [2025-01-09 04:46:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:35,997 INFO L471 AbstractCegarLoop]: Abstraction has 66418 states and 102380 transitions. [2025-01-09 04:46:35,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 04:46:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 66418 states and 102380 transitions. [2025-01-09 04:46:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:46:36,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:36,009 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] [2025-01-09 04:46:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:46:36,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:36,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -835025571, now seen corresponding path program 1 times [2025-01-09 04:46:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593154369] [2025-01-09 04:46:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:36,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:46:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:46:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:36,332 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 04:46:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593154369] [2025-01-09 04:46:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593154369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:46:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591471207] [2025-01-09 04:46:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:36,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:36,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:36,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:36,333 INFO L87 Difference]: Start difference. First operand 66418 states and 102380 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 04:46:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:36,986 INFO L93 Difference]: Finished difference Result 67828 states and 104493 transitions. [2025-01-09 04:46:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2025-01-09 04:46:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:37,064 INFO L225 Difference]: With dead ends: 67828 [2025-01-09 04:46:37,064 INFO L226 Difference]: Without dead ends: 67826 [2025-01-09 04:46:37,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:37,083 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:37,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1350 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2025-01-09 04:46:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 67826. [2025-01-09 04:46:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67826 states, 67825 states have (on average 1.53023221525986) internal successors, (103788), 67825 states have internal predecessors, (103788), 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 04:46:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67826 states to 67826 states and 103788 transitions. [2025-01-09 04:46:37,995 INFO L78 Accepts]: Start accepts. Automaton has 67826 states and 103788 transitions. Word has length 99 [2025-01-09 04:46:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:37,996 INFO L471 AbstractCegarLoop]: Abstraction has 67826 states and 103788 transitions. [2025-01-09 04:46:37,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 04:46:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 67826 states and 103788 transitions. [2025-01-09 04:46:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:46:38,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:38,014 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] [2025-01-09 04:46:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:46:38,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 210130591, now seen corresponding path program 1 times [2025-01-09 04:46:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422873376] [2025-01-09 04:46:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:38,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:46:38,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:46:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:38,505 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 04:46:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422873376] [2025-01-09 04:46:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422873376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69049767] [2025-01-09 04:46:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:38,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:46:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:38,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:46:38,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:46:38,507 INFO L87 Difference]: Start difference. First operand 67826 states and 103788 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 04:46:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:39,293 INFO L93 Difference]: Finished difference Result 192566 states and 293934 transitions. [2025-01-09 04:46:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:46:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2025-01-09 04:46:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:39,503 INFO L225 Difference]: With dead ends: 192566 [2025-01-09 04:46:39,503 INFO L226 Difference]: Without dead ends: 126516 [2025-01-09 04:46:39,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:46:39,559 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 278 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:39,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 728 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126516 states. [2025-01-09 04:46:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126516 to 126514. [2025-01-09 04:46:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126514 states, 126513 states have (on average 1.5184842664390221) internal successors, (192108), 126513 states have internal predecessors, (192108), 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 04:46:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126514 states to 126514 states and 192108 transitions. [2025-01-09 04:46:41,524 INFO L78 Accepts]: Start accepts. Automaton has 126514 states and 192108 transitions. Word has length 100 [2025-01-09 04:46:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:41,525 INFO L471 AbstractCegarLoop]: Abstraction has 126514 states and 192108 transitions. [2025-01-09 04:46:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 04:46:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 126514 states and 192108 transitions. [2025-01-09 04:46:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:46:41,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:41,539 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] [2025-01-09 04:46:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:46:41,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:41,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1298936868, now seen corresponding path program 1 times [2025-01-09 04:46:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145132653] [2025-01-09 04:46:41,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:41,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:46:41,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:46:41,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:41,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:41,666 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 04:46:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145132653] [2025-01-09 04:46:41,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145132653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:41,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733114852] [2025-01-09 04:46:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:41,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:41,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:41,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:41,667 INFO L87 Difference]: Start difference. First operand 126514 states and 192108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:42,472 INFO L93 Difference]: Finished difference Result 294992 states and 448048 transitions. [2025-01-09 04:46:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:46:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:43,047 INFO L225 Difference]: With dead ends: 294992 [2025-01-09 04:46:43,048 INFO L226 Difference]: Without dead ends: 179568 [2025-01-09 04:46:43,113 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 04:46:43,118 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 247 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:43,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 672 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179568 states. [2025-01-09 04:46:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179568 to 125871. [2025-01-09 04:46:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125871 states, 125870 states have (on average 1.508365774211488) internal successors, (189858), 125870 states have internal predecessors, (189858), 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 04:46:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125871 states to 125871 states and 189858 transitions. [2025-01-09 04:46:45,007 INFO L78 Accepts]: Start accepts. Automaton has 125871 states and 189858 transitions. Word has length 101 [2025-01-09 04:46:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:45,007 INFO L471 AbstractCegarLoop]: Abstraction has 125871 states and 189858 transitions. [2025-01-09 04:46:45,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125871 states and 189858 transitions. [2025-01-09 04:46:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:46:45,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:45,018 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] [2025-01-09 04:46:45,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:46:45,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:45,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1679101979, now seen corresponding path program 1 times [2025-01-09 04:46:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:45,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027536209] [2025-01-09 04:46:45,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:46:45,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:46:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:45,158 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 04:46:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027536209] [2025-01-09 04:46:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027536209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661155818] [2025-01-09 04:46:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:45,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:45,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:45,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:45,163 INFO L87 Difference]: Start difference. First operand 125871 states and 189858 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:46,281 INFO L93 Difference]: Finished difference Result 278550 states and 419581 transitions. [2025-01-09 04:46:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:46:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:46,486 INFO L225 Difference]: With dead ends: 278550 [2025-01-09 04:46:46,487 INFO L226 Difference]: Without dead ends: 163862 [2025-01-09 04:46:46,546 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 04:46:46,546 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 239 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:46,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 657 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163862 states. [2025-01-09 04:46:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163862 to 163027. [2025-01-09 04:46:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163027 states, 163026 states have (on average 1.4907008697999091) internal successors, (243023), 163026 states have internal predecessors, (243023), 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 04:46:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163027 states to 163027 states and 243023 transitions. [2025-01-09 04:46:48,417 INFO L78 Accepts]: Start accepts. Automaton has 163027 states and 243023 transitions. Word has length 101 [2025-01-09 04:46:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:48,417 INFO L471 AbstractCegarLoop]: Abstraction has 163027 states and 243023 transitions. [2025-01-09 04:46:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 163027 states and 243023 transitions. [2025-01-09 04:46:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:46:48,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:48,429 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] [2025-01-09 04:46:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:46:48,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 219382229, now seen corresponding path program 1 times [2025-01-09 04:46:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199026562] [2025-01-09 04:46:48,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:48,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:46:48,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:46:48,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:48,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:48,478 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 04:46:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199026562] [2025-01-09 04:46:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199026562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:48,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605727942] [2025-01-09 04:46:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:48,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:48,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:48,479 INFO L87 Difference]: Start difference. First operand 163027 states and 243023 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:49,487 INFO L93 Difference]: Finished difference Result 215109 states and 320207 transitions. [2025-01-09 04:46:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:49,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:46:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:49,752 INFO L225 Difference]: With dead ends: 215109 [2025-01-09 04:46:49,752 INFO L226 Difference]: Without dead ends: 177859 [2025-01-09 04:46:49,830 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 04:46:49,831 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 200 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:49,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 658 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177859 states. [2025-01-09 04:46:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177859 to 160577. [2025-01-09 04:46:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160577 states, 160576 states have (on average 1.4718824730968514) internal successors, (236349), 160576 states have internal predecessors, (236349), 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 04:46:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160577 states to 160577 states and 236349 transitions. [2025-01-09 04:46:52,070 INFO L78 Accepts]: Start accepts. Automaton has 160577 states and 236349 transitions. Word has length 101 [2025-01-09 04:46:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:52,070 INFO L471 AbstractCegarLoop]: Abstraction has 160577 states and 236349 transitions. [2025-01-09 04:46:52,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 160577 states and 236349 transitions. [2025-01-09 04:46:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:46:52,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:52,082 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] [2025-01-09 04:46:52,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:46:52,082 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1721063836, now seen corresponding path program 1 times [2025-01-09 04:46:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959297241] [2025-01-09 04:46:52,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:46:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:46:52,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:52,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:52,137 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 04:46:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959297241] [2025-01-09 04:46:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959297241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70846512] [2025-01-09 04:46:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:52,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:52,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:52,138 INFO L87 Difference]: Start difference. First operand 160577 states and 236349 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:53,219 INFO L93 Difference]: Finished difference Result 250847 states and 369466 transitions. [2025-01-09 04:46:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:46:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:53,487 INFO L225 Difference]: With dead ends: 250847 [2025-01-09 04:46:53,488 INFO L226 Difference]: Without dead ends: 181829 [2025-01-09 04:46:53,540 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 04:46:53,541 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 206 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:53,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 653 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181829 states. [2025-01-09 04:46:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181829 to 180291. [2025-01-09 04:46:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180291 states, 180290 states have (on average 1.4523268068112485) internal successors, (261840), 180290 states have internal predecessors, (261840), 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 04:46:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180291 states to 180291 states and 261840 transitions. [2025-01-09 04:46:55,893 INFO L78 Accepts]: Start accepts. Automaton has 180291 states and 261840 transitions. Word has length 101 [2025-01-09 04:46:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:55,893 INFO L471 AbstractCegarLoop]: Abstraction has 180291 states and 261840 transitions. [2025-01-09 04:46:55,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 180291 states and 261840 transitions. [2025-01-09 04:46:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:46:55,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:55,906 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] [2025-01-09 04:46:55,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:46:55,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -729942331, now seen corresponding path program 1 times [2025-01-09 04:46:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921380473] [2025-01-09 04:46:55,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:46:55,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:46:55,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:55,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:55,950 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 04:46:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921380473] [2025-01-09 04:46:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921380473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:55,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449789420] [2025-01-09 04:46:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:55,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:55,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:55,952 INFO L87 Difference]: Start difference. First operand 180291 states and 261840 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:46:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:57,073 INFO L93 Difference]: Finished difference Result 336279 states and 488161 transitions. [2025-01-09 04:46:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:57,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-01-09 04:46:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:57,340 INFO L225 Difference]: With dead ends: 336279 [2025-01-09 04:46:57,340 INFO L226 Difference]: Without dead ends: 215549 [2025-01-09 04:46:57,429 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 04:46:57,430 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 216 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:57,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 651 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215549 states. [2025-01-09 04:46:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215549 to 213867. [2025-01-09 04:46:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213867 states, 213866 states have (on average 1.4295540198067949) internal successors, (305733), 213866 states have internal predecessors, (305733), 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 04:47:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213867 states to 213867 states and 305733 transitions. [2025-01-09 04:47:00,065 INFO L78 Accepts]: Start accepts. Automaton has 213867 states and 305733 transitions. Word has length 101 [2025-01-09 04:47:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:47:00,067 INFO L471 AbstractCegarLoop]: Abstraction has 213867 states and 305733 transitions. [2025-01-09 04:47:00,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 04:47:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 213867 states and 305733 transitions. [2025-01-09 04:47:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:47:00,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:47:00,084 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] [2025-01-09 04:47:00,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:47:00,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:47:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:47:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -701746876, now seen corresponding path program 1 times [2025-01-09 04:47:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:47:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077541066] [2025-01-09 04:47:00,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:47:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:47:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:47:00,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:47:00,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:47:00,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:47:00,310 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 04:47:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:47:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077541066] [2025-01-09 04:47:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077541066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:47:00,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:47:00,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:47:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090887810] [2025-01-09 04:47:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:47:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:47:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:47:00,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:47:00,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:47:00,312 INFO L87 Difference]: Start difference. First operand 213867 states and 305733 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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 04:47:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:47:02,641 INFO L93 Difference]: Finished difference Result 614233 states and 883625 transitions. [2025-01-09 04:47:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:47:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-01-09 04:47:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:47:03,530 INFO L225 Difference]: With dead ends: 614233 [2025-01-09 04:47:03,530 INFO L226 Difference]: Without dead ends: 522851 [2025-01-09 04:47:03,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:47:03,660 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 2709 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:47:03,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 2315 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:47:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522851 states.