./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.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 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:48:37,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:48:37,357 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:48:37,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:48:37,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:48:37,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:48:37,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:48:37,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:48:37,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:48:37,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:48:37,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:48:37,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:48:37,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:48:37,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:48:37,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:48:37,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:37,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:37,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:48:37,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:48:37,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:48:37,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:48:37,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:48:37,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:48:37,379 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 -> 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 [2025-01-09 04:48:37,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:48:37,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:48:37,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:48:37,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:48:37,738 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:48:37,740 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:48:38,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/800adc3da/24015ee404b1407c85296bb70d7a9b23/FLAGf93940cb2 [2025-01-09 04:48:39,270 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:48:39,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:48:39,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/800adc3da/24015ee404b1407c85296bb70d7a9b23/FLAGf93940cb2 [2025-01-09 04:48:39,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/800adc3da/24015ee404b1407c85296bb70d7a9b23 [2025-01-09 04:48:39,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:48:39,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:48:39,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:48:39,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:48:39,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:48:39,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d436e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39, skipping insertion in model container [2025-01-09 04:48:39,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:48:39,701 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2025-01-09 04:48:39,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:48:39,755 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:48:39,786 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2025-01-09 04:48:39,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:48:39,821 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:48:39,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39 WrapperNode [2025-01-09 04:48:39,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:48:39,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:48:39,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:48:39,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:48:39,828 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:48:39" (1/1) ... [2025-01-09 04:48:39,836 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:48:39" (1/1) ... [2025-01-09 04:48:39,858 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 576 [2025-01-09 04:48:39,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:48:39,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:48:39,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:48:39,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:48:39,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,876 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:48:39,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:48:39,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:48:39,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:48:39,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:48:39,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (1/1) ... [2025-01-09 04:48:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:48:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:48:39,925 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:48:39,930 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:48:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:48:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:48:39,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:48:39,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:48:40,043 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:48:40,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:48:40,490 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 04:48:40,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:48:40,501 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:48:40,501 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:48:40,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:40 BoogieIcfgContainer [2025-01-09 04:48:40,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:48:40,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:48:40,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:48:40,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:48:40,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:48:39" (1/3) ... [2025-01-09 04:48:40,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bec18b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:40, skipping insertion in model container [2025-01-09 04:48:40,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:39" (2/3) ... [2025-01-09 04:48:40,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bec18b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:40, skipping insertion in model container [2025-01-09 04:48:40,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:40" (3/3) ... [2025-01-09 04:48:40,509 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:48:40,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:48:40,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 123 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:48:40,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:48:40,570 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;@27f8ff42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:48:40,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:48:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 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:48:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:48:40,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:40,579 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] [2025-01-09 04:48:40,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1296157629, now seen corresponding path program 1 times [2025-01-09 04:48:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493893445] [2025-01-09 04:48:40,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:40,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:48:40,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:48:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:41,094 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:48:41,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:41,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493893445] [2025-01-09 04:48:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493893445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:41,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074809085] [2025-01-09 04:48:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:41,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:41,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:41,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:41,118 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 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 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:48:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:41,365 INFO L93 Difference]: Finished difference Result 589 states and 942 transitions. [2025-01-09 04:48:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:48:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 62 [2025-01-09 04:48:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:41,378 INFO L225 Difference]: With dead ends: 589 [2025-01-09 04:48:41,378 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 04:48:41,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:48:41,383 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 910 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:41,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1605 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 04:48:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 185. [2025-01-09 04:48:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 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:48:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2025-01-09 04:48:41,459 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 62 [2025-01-09 04:48:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2025-01-09 04:48:41,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:48:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2025-01-09 04:48:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:41,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:41,461 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] [2025-01-09 04:48:41,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:48:41,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -574954446, now seen corresponding path program 1 times [2025-01-09 04:48:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005958618] [2025-01-09 04:48:41,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:41,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:41,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:41,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:41,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:41,703 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:48:41,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:41,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005958618] [2025-01-09 04:48:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005958618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:41,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398895309] [2025-01-09 04:48:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:41,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:41,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:41,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:41,707 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:41,811 INFO L93 Difference]: Finished difference Result 654 states and 1000 transitions. [2025-01-09 04:48:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:48:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:41,814 INFO L225 Difference]: With dead ends: 654 [2025-01-09 04:48:41,815 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 04:48:41,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:41,817 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 521 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:41,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 889 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 04:48:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 294. [2025-01-09 04:48:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 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:48:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2025-01-09 04:48:41,839 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 64 [2025-01-09 04:48:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:41,840 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2025-01-09 04:48:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2025-01-09 04:48:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:41,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:41,842 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] [2025-01-09 04:48:41,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:48:41,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:41,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -254559290, now seen corresponding path program 1 times [2025-01-09 04:48:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246129887] [2025-01-09 04:48:41,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:42,037 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:48:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246129887] [2025-01-09 04:48:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246129887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646208571] [2025-01-09 04:48:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:42,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:42,041 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:42,131 INFO L93 Difference]: Finished difference Result 763 states and 1172 transitions. [2025-01-09 04:48:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:48:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:42,134 INFO L225 Difference]: With dead ends: 763 [2025-01-09 04:48:42,134 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 04:48:42,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:42,137 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 599 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:42,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 792 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 04:48:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 447. [2025-01-09 04:48:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 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:48:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 680 transitions. [2025-01-09 04:48:42,168 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 680 transitions. Word has length 64 [2025-01-09 04:48:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:42,168 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 680 transitions. [2025-01-09 04:48:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 680 transitions. [2025-01-09 04:48:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:42,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:42,172 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] [2025-01-09 04:48:42,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:48:42,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1989488918, now seen corresponding path program 1 times [2025-01-09 04:48:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969652984] [2025-01-09 04:48:42,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:42,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:42,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:42,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969652984] [2025-01-09 04:48:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969652984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430995422] [2025-01-09 04:48:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:42,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:42,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:42,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:42,445 INFO L87 Difference]: Start difference. First operand 447 states and 680 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:42,551 INFO L93 Difference]: Finished difference Result 862 states and 1328 transitions. [2025-01-09 04:48:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:48:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:42,555 INFO L225 Difference]: With dead ends: 862 [2025-01-09 04:48:42,556 INFO L226 Difference]: Without dead ends: 762 [2025-01-09 04:48:42,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:42,559 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 674 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:42,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 788 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-09 04:48:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 546. [2025-01-09 04:48:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 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:48:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 836 transitions. [2025-01-09 04:48:42,576 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 836 transitions. Word has length 64 [2025-01-09 04:48:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:42,576 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 836 transitions. [2025-01-09 04:48:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 836 transitions. [2025-01-09 04:48:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:42,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:42,580 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] [2025-01-09 04:48:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:48:42,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:42,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1188595012, now seen corresponding path program 1 times [2025-01-09 04:48:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496290916] [2025-01-09 04:48:42,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:42,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:42,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:42,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:42,646 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:48:42,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496290916] [2025-01-09 04:48:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496290916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:48:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752728148] [2025-01-09 04:48:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:42,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:48:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:42,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:48:42,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:48:42,649 INFO L87 Difference]: Start difference. First operand 546 states and 836 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:48:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:42,671 INFO L93 Difference]: Finished difference Result 1374 states and 2132 transitions. [2025-01-09 04:48:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:48:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:42,676 INFO L225 Difference]: With dead ends: 1374 [2025-01-09 04:48:42,676 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 04:48:42,677 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:48:42,678 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:42,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 04:48:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2025-01-09 04:48:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 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:48:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1414 transitions. [2025-01-09 04:48:42,700 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1414 transitions. Word has length 64 [2025-01-09 04:48:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:42,701 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1414 transitions. [2025-01-09 04:48:42,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:48:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1414 transitions. [2025-01-09 04:48:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:42,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:42,703 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] [2025-01-09 04:48:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:48:42,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1017922373, now seen corresponding path program 1 times [2025-01-09 04:48:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:42,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584877636] [2025-01-09 04:48:42,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:42,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:42,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:42,997 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:48:43,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:43,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584877636] [2025-01-09 04:48:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584877636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810978490] [2025-01-09 04:48:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:43,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:43,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:43,002 INFO L87 Difference]: Start difference. First operand 929 states and 1414 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:43,154 INFO L93 Difference]: Finished difference Result 1757 states and 2692 transitions. [2025-01-09 04:48:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:48:43,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:43,158 INFO L225 Difference]: With dead ends: 1757 [2025-01-09 04:48:43,158 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 04:48:43,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:48:43,160 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 106 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:43,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 616 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 04:48:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2025-01-09 04:48:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 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:48:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1409 transitions. [2025-01-09 04:48:43,181 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1409 transitions. Word has length 64 [2025-01-09 04:48:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:43,181 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1409 transitions. [2025-01-09 04:48:43,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1409 transitions. [2025-01-09 04:48:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:48:43,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:43,182 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] [2025-01-09 04:48:43,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:48:43,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash 145774506, now seen corresponding path program 1 times [2025-01-09 04:48:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952866441] [2025-01-09 04:48:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:43,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:48:43,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:48:43,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:43,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:43,356 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:48:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952866441] [2025-01-09 04:48:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952866441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:43,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388979307] [2025-01-09 04:48:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:43,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:48:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:48:43,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:48:43,358 INFO L87 Difference]: Start difference. First operand 929 states and 1409 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:43,441 INFO L93 Difference]: Finished difference Result 1689 states and 2577 transitions. [2025-01-09 04:48:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:48:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 04:48:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:43,446 INFO L225 Difference]: With dead ends: 1689 [2025-01-09 04:48:43,446 INFO L226 Difference]: Without dead ends: 1504 [2025-01-09 04:48:43,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:43,447 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 645 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:43,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 926 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-09 04:48:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1123. [2025-01-09 04:48:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 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:48:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1708 transitions. [2025-01-09 04:48:43,470 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1708 transitions. Word has length 64 [2025-01-09 04:48:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1708 transitions. [2025-01-09 04:48:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:48:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1708 transitions. [2025-01-09 04:48:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:48:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:43,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:48:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:48:43,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1968503380, now seen corresponding path program 1 times [2025-01-09 04:48:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174171219] [2025-01-09 04:48:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:48:43,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:48:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:43,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:43,558 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:48:43,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:43,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174171219] [2025-01-09 04:48:43,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174171219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:43,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459979656] [2025-01-09 04:48:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:43,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:43,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:43,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:43,559 INFO L87 Difference]: Start difference. First operand 1123 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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:48:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:43,695 INFO L93 Difference]: Finished difference Result 3265 states and 5000 transitions. [2025-01-09 04:48:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-01-09 04:48:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:43,701 INFO L225 Difference]: With dead ends: 3265 [2025-01-09 04:48:43,701 INFO L226 Difference]: Without dead ends: 2172 [2025-01-09 04:48:43,703 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:48:43,703 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 659 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 144 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2025-01-09 04:48:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170. [2025-01-09 04:48:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 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:48:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3299 transitions. [2025-01-09 04:48:43,737 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3299 transitions. Word has length 65 [2025-01-09 04:48:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3299 transitions. [2025-01-09 04:48:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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:48:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3299 transitions. [2025-01-09 04:48:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:48:43,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:43,739 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] [2025-01-09 04:48:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:48:43,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1032507974, now seen corresponding path program 1 times [2025-01-09 04:48:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155327965] [2025-01-09 04:48:43,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:43,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:48:43,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:48:43,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:43,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:43,816 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:48:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155327965] [2025-01-09 04:48:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155327965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682066582] [2025-01-09 04:48:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:43,818 INFO L87 Difference]: Start difference. First operand 2170 states and 3299 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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:48:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:43,910 INFO L93 Difference]: Finished difference Result 4298 states and 6553 transitions. [2025-01-09 04:48:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-01-09 04:48:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:43,915 INFO L225 Difference]: With dead ends: 4298 [2025-01-09 04:48:43,915 INFO L226 Difference]: Without dead ends: 2170 [2025-01-09 04:48:43,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:48:43,917 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 414 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:43,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-01-09 04:48:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-01-09 04:48:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 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:48:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3254 transitions. [2025-01-09 04:48:43,946 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3254 transitions. Word has length 66 [2025-01-09 04:48:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:43,946 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3254 transitions. [2025-01-09 04:48:43,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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:48:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3254 transitions. [2025-01-09 04:48:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:48:43,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:43,947 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] [2025-01-09 04:48:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:48:43,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:43,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1666418400, now seen corresponding path program 1 times [2025-01-09 04:48:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066163631] [2025-01-09 04:48:43,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:43,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:48:43,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:48:43,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:43,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:44,021 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:48:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066163631] [2025-01-09 04:48:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066163631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745330765] [2025-01-09 04:48:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:44,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:44,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:44,022 INFO L87 Difference]: Start difference. First operand 2170 states and 3254 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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:48:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:44,136 INFO L93 Difference]: Finished difference Result 4306 states and 6473 transitions. [2025-01-09 04:48:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-01-09 04:48:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:44,141 INFO L225 Difference]: With dead ends: 4306 [2025-01-09 04:48:44,142 INFO L226 Difference]: Without dead ends: 2170 [2025-01-09 04:48:44,144 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:48:44,144 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 430 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:44,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 97 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-01-09 04:48:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-01-09 04:48:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 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:48:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3209 transitions. [2025-01-09 04:48:44,172 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3209 transitions. Word has length 67 [2025-01-09 04:48:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3209 transitions. [2025-01-09 04:48:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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:48:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3209 transitions. [2025-01-09 04:48:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:48:44,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:44,173 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] [2025-01-09 04:48:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:48:44,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:44,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1540735366, now seen corresponding path program 1 times [2025-01-09 04:48:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801113099] [2025-01-09 04:48:44,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:48:44,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:48:44,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:44,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:44,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801113099] [2025-01-09 04:48:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801113099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:44,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:44,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510336764] [2025-01-09 04:48:44,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:44,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:44,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:44,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:44,235 INFO L87 Difference]: Start difference. First operand 2170 states and 3209 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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:48:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:44,317 INFO L93 Difference]: Finished difference Result 4302 states and 6379 transitions. [2025-01-09 04:48:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-01-09 04:48:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:44,322 INFO L225 Difference]: With dead ends: 4302 [2025-01-09 04:48:44,322 INFO L226 Difference]: Without dead ends: 2170 [2025-01-09 04:48:44,324 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:48:44,325 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 412 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:44,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 105 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-01-09 04:48:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-01-09 04:48:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 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:48:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3164 transitions. [2025-01-09 04:48:44,354 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3164 transitions. Word has length 68 [2025-01-09 04:48:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:44,354 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3164 transitions. [2025-01-09 04:48:44,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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:48:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3164 transitions. [2025-01-09 04:48:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:48:44,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:44,355 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] [2025-01-09 04:48:44,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:48:44,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:44,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash -147544852, now seen corresponding path program 1 times [2025-01-09 04:48:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47231999] [2025-01-09 04:48:44,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:44,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:48:44,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:48:44,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:44,580 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:48:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47231999] [2025-01-09 04:48:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47231999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:48:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631899001] [2025-01-09 04:48:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:44,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:48:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:44,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:48:44,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:48:44,582 INFO L87 Difference]: Start difference. First operand 2170 states and 3164 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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:48:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:44,838 INFO L93 Difference]: Finished difference Result 6251 states and 9140 transitions. [2025-01-09 04:48:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:48:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2025-01-09 04:48:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:44,847 INFO L225 Difference]: With dead ends: 6251 [2025-01-09 04:48:44,847 INFO L226 Difference]: Without dead ends: 4195 [2025-01-09 04:48:44,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:48:44,849 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 576 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:44,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 360 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2025-01-09 04:48:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 2170. [2025-01-09 04:48:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.458275703088981) internal successors, (3163), 2169 states have internal predecessors, (3163), 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:48:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3163 transitions. [2025-01-09 04:48:44,885 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3163 transitions. Word has length 69 [2025-01-09 04:48:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:44,885 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3163 transitions. [2025-01-09 04:48:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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:48:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3163 transitions. [2025-01-09 04:48:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:48:44,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:44,886 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] [2025-01-09 04:48:44,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:48:44,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:44,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 682625962, now seen corresponding path program 1 times [2025-01-09 04:48:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038953433] [2025-01-09 04:48:44,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:44,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:48:44,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:48:44,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:45,201 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:48:45,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038953433] [2025-01-09 04:48:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038953433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:48:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285031644] [2025-01-09 04:48:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:45,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:48:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:45,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:48:45,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:48:45,203 INFO L87 Difference]: Start difference. First operand 2170 states and 3163 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 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:48:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:45,677 INFO L93 Difference]: Finished difference Result 6506 states and 9412 transitions. [2025-01-09 04:48:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:48:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 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 70 [2025-01-09 04:48:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:45,688 INFO L225 Difference]: With dead ends: 6506 [2025-01-09 04:48:45,688 INFO L226 Difference]: Without dead ends: 4469 [2025-01-09 04:48:45,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:48:45,692 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 559 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:45,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 567 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2025-01-09 04:48:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 2179. [2025-01-09 04:48:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 2178 states have (on average 1.4563820018365472) internal successors, (3172), 2178 states have internal predecessors, (3172), 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:48:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3172 transitions. [2025-01-09 04:48:45,754 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3172 transitions. Word has length 70 [2025-01-09 04:48:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:45,754 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 3172 transitions. [2025-01-09 04:48:45,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 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:48:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3172 transitions. [2025-01-09 04:48:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:48:45,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:45,755 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] [2025-01-09 04:48:45,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:48:45,756 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:45,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 158979165, now seen corresponding path program 1 times [2025-01-09 04:48:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614572505] [2025-01-09 04:48:45,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:45,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:48:45,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:48:45,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:45,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:46,039 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:48:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614572505] [2025-01-09 04:48:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614572505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:48:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588716442] [2025-01-09 04:48:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:48:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:46,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:48:46,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:48:46,041 INFO L87 Difference]: Start difference. First operand 2179 states and 3172 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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:48:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:46,422 INFO L93 Difference]: Finished difference Result 4688 states and 6812 transitions. [2025-01-09 04:48:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:48:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-01-09 04:48:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:46,432 INFO L225 Difference]: With dead ends: 4688 [2025-01-09 04:48:46,432 INFO L226 Difference]: Without dead ends: 2618 [2025-01-09 04:48:46,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:48:46,435 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 692 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:46,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 593 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2025-01-09 04:48:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2170. [2025-01-09 04:48:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.4568925772245274) internal successors, (3160), 2169 states have internal predecessors, (3160), 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:48:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3160 transitions. [2025-01-09 04:48:46,462 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3160 transitions. Word has length 70 [2025-01-09 04:48:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:46,462 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3160 transitions. [2025-01-09 04:48:46,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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:48:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3160 transitions. [2025-01-09 04:48:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:48:46,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:46,463 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] [2025-01-09 04:48:46,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:48:46,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 559312961, now seen corresponding path program 1 times [2025-01-09 04:48:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510260562] [2025-01-09 04:48:46,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:46,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:48:46,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:48:46,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:46,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:46,730 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:48:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510260562] [2025-01-09 04:48:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510260562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:48:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800015752] [2025-01-09 04:48:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:48:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:46,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:48:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:48:46,731 INFO L87 Difference]: Start difference. First operand 2170 states and 3160 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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:48:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:47,274 INFO L93 Difference]: Finished difference Result 6383 states and 9292 transitions. [2025-01-09 04:48:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:48:47,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-01-09 04:48:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:47,289 INFO L225 Difference]: With dead ends: 6383 [2025-01-09 04:48:47,290 INFO L226 Difference]: Without dead ends: 4328 [2025-01-09 04:48:47,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:48:47,297 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 825 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:47,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 470 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:48:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2025-01-09 04:48:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 2170. [2025-01-09 04:48:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.45412632549562) internal successors, (3154), 2169 states have internal predecessors, (3154), 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:48:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3154 transitions. [2025-01-09 04:48:47,366 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3154 transitions. Word has length 70 [2025-01-09 04:48:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3154 transitions. [2025-01-09 04:48:47,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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:48:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3154 transitions. [2025-01-09 04:48:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:48:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:47,368 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] [2025-01-09 04:48:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:48:47,368 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:47,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1255258839, now seen corresponding path program 1 times [2025-01-09 04:48:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724938250] [2025-01-09 04:48:47,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:47,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:48:47,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:48:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:47,796 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:48:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724938250] [2025-01-09 04:48:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724938250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:48:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021693078] [2025-01-09 04:48:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:48:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:47,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:48:47,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:48:47,801 INFO L87 Difference]: Start difference. First operand 2170 states and 3154 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 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:48:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:48,373 INFO L93 Difference]: Finished difference Result 6338 states and 9214 transitions. [2025-01-09 04:48:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:48:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 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 71 [2025-01-09 04:48:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:48,379 INFO L225 Difference]: With dead ends: 6338 [2025-01-09 04:48:48,380 INFO L226 Difference]: Without dead ends: 4313 [2025-01-09 04:48:48,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:48:48,383 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 818 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:48,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 441 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-01-09 04:48:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 2170. [2025-01-09 04:48:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.449976947902259) internal successors, (3145), 2169 states have internal predecessors, (3145), 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:48:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3145 transitions. [2025-01-09 04:48:48,416 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3145 transitions. Word has length 71 [2025-01-09 04:48:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:48,417 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3145 transitions. [2025-01-09 04:48:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 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:48:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3145 transitions. [2025-01-09 04:48:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:48:48,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:48,418 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] [2025-01-09 04:48:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:48:48,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1977550344, now seen corresponding path program 1 times [2025-01-09 04:48:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146413323] [2025-01-09 04:48:48,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:48:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:48:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:49,203 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:48:49,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146413323] [2025-01-09 04:48:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146413323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:48:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036993262] [2025-01-09 04:48:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:49,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:48:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:49,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:48:49,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:48:49,204 INFO L87 Difference]: Start difference. First operand 2170 states and 3145 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:48:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:49,844 INFO L93 Difference]: Finished difference Result 9005 states and 13146 transitions. [2025-01-09 04:48:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:48:49,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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 72 [2025-01-09 04:48:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:49,857 INFO L225 Difference]: With dead ends: 9005 [2025-01-09 04:48:49,858 INFO L226 Difference]: Without dead ends: 8267 [2025-01-09 04:48:49,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:48:49,861 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 916 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:49,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1796 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-01-09 04:48:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 2168. [2025-01-09 04:48:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2167 states have (on average 1.4462390401476697) internal successors, (3134), 2167 states have internal predecessors, (3134), 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:48:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3134 transitions. [2025-01-09 04:48:49,912 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3134 transitions. Word has length 72 [2025-01-09 04:48:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:49,912 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 3134 transitions. [2025-01-09 04:48:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:48:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3134 transitions. [2025-01-09 04:48:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:48:49,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:49,913 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] [2025-01-09 04:48:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:48:49,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 821766808, now seen corresponding path program 1 times [2025-01-09 04:48:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479153258] [2025-01-09 04:48:49,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:49,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:48:49,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:48:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:50,578 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:48:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479153258] [2025-01-09 04:48:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479153258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:50,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:50,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:48:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194051060] [2025-01-09 04:48:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:50,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:48:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:50,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:48:50,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:48:50,580 INFO L87 Difference]: Start difference. First operand 2168 states and 3134 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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:48:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:51,641 INFO L93 Difference]: Finished difference Result 3276 states and 4753 transitions. [2025-01-09 04:48:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:48:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 72 [2025-01-09 04:48:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:51,644 INFO L225 Difference]: With dead ends: 3276 [2025-01-09 04:48:51,644 INFO L226 Difference]: Without dead ends: 2503 [2025-01-09 04:48:51,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:48:51,645 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 691 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:51,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1216 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:48:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-01-09 04:48:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2135. [2025-01-09 04:48:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2135 states, 2134 states have (on average 1.4475164011246486) internal successors, (3089), 2134 states have internal predecessors, (3089), 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:48:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 3089 transitions. [2025-01-09 04:48:51,666 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 3089 transitions. Word has length 72 [2025-01-09 04:48:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:51,666 INFO L471 AbstractCegarLoop]: Abstraction has 2135 states and 3089 transitions. [2025-01-09 04:48:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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:48:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 3089 transitions. [2025-01-09 04:48:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:48:51,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:51,667 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] [2025-01-09 04:48:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:48:51,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:51,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 727688951, now seen corresponding path program 1 times [2025-01-09 04:48:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303008130] [2025-01-09 04:48:51,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:51,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:48:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:48:51,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:51,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:52,319 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:48:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303008130] [2025-01-09 04:48:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303008130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:52,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:52,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:48:52,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288721932] [2025-01-09 04:48:52,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:52,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:48:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:52,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:48:52,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:48:52,321 INFO L87 Difference]: Start difference. First operand 2135 states and 3089 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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:48:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:52,816 INFO L93 Difference]: Finished difference Result 4918 states and 7161 transitions. [2025-01-09 04:48:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:48:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 72 [2025-01-09 04:48:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:52,822 INFO L225 Difference]: With dead ends: 4918 [2025-01-09 04:48:52,822 INFO L226 Difference]: Without dead ends: 4166 [2025-01-09 04:48:52,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:48:52,823 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 662 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:52,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1279 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2025-01-09 04:48:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 2117. [2025-01-09 04:48:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.4484877126654063) internal successors, (3065), 2116 states have internal predecessors, (3065), 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:48:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3065 transitions. [2025-01-09 04:48:52,843 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3065 transitions. Word has length 72 [2025-01-09 04:48:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3065 transitions. [2025-01-09 04:48:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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:48:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3065 transitions. [2025-01-09 04:48:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:48:52,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:52,844 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] [2025-01-09 04:48:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:48:52,844 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:52,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 142597694, now seen corresponding path program 1 times [2025-01-09 04:48:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004050211] [2025-01-09 04:48:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:48:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:48:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:52,921 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:48:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004050211] [2025-01-09 04:48:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004050211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:48:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707440854] [2025-01-09 04:48:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:48:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:52,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:48:52,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:48:52,922 INFO L87 Difference]: Start difference. First operand 2117 states and 3065 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:48:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:52,942 INFO L93 Difference]: Finished difference Result 5006 states and 7301 transitions. [2025-01-09 04:48:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:48:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 73 [2025-01-09 04:48:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:52,946 INFO L225 Difference]: With dead ends: 5006 [2025-01-09 04:48:52,946 INFO L226 Difference]: Without dead ends: 2990 [2025-01-09 04:48:52,948 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:48:52,948 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 72 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:52,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 351 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2025-01-09 04:48:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2025-01-09 04:48:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2987 states have (on average 1.4449280214261802) internal successors, (4316), 2987 states have internal predecessors, (4316), 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:48:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4316 transitions. [2025-01-09 04:48:52,973 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4316 transitions. Word has length 73 [2025-01-09 04:48:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:52,974 INFO L471 AbstractCegarLoop]: Abstraction has 2988 states and 4316 transitions. [2025-01-09 04:48:52,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:48:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4316 transitions. [2025-01-09 04:48:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:48:52,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:52,974 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] [2025-01-09 04:48:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:48:52,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:52,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 976329794, now seen corresponding path program 1 times [2025-01-09 04:48:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407985788] [2025-01-09 04:48:52,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:52,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:48:52,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:48:52,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:52,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:53,114 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:48:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407985788] [2025-01-09 04:48:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407985788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:48:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254557434] [2025-01-09 04:48:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:48:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:53,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:48:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:48:53,116 INFO L87 Difference]: Start difference. First operand 2988 states and 4316 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:48:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:53,136 INFO L93 Difference]: Finished difference Result 3010 states and 4347 transitions. [2025-01-09 04:48:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:48:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2025-01-09 04:48:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:53,142 INFO L225 Difference]: With dead ends: 3010 [2025-01-09 04:48:53,142 INFO L226 Difference]: Without dead ends: 3008 [2025-01-09 04:48:53,143 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:48:53,144 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:53,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-09 04:48:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-09 04:48:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4343199201862322) internal successors, (4313), 3007 states have internal predecessors, (4313), 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:48:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4313 transitions. [2025-01-09 04:48:53,171 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4313 transitions. Word has length 73 [2025-01-09 04:48:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:53,171 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4313 transitions. [2025-01-09 04:48:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:48:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4313 transitions. [2025-01-09 04:48:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:48:53,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:53,171 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] [2025-01-09 04:48:53,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:48:53,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:53,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash 982723524, now seen corresponding path program 1 times [2025-01-09 04:48:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731257059] [2025-01-09 04:48:53,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:53,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:48:53,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:48:53,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:53,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:53,512 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:48:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731257059] [2025-01-09 04:48:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731257059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:48:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660869133] [2025-01-09 04:48:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:53,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:48:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:53,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:48:53,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:48:53,514 INFO L87 Difference]: Start difference. First operand 3008 states and 4313 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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:48:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:53,899 INFO L93 Difference]: Finished difference Result 6659 states and 9598 transitions. [2025-01-09 04:48:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:48:53,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 73 [2025-01-09 04:48:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:53,909 INFO L225 Difference]: With dead ends: 6659 [2025-01-09 04:48:53,909 INFO L226 Difference]: Without dead ends: 5727 [2025-01-09 04:48:53,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:48:53,913 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 505 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:53,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1297 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:48:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2025-01-09 04:48:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 2905. [2025-01-09 04:48:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2904 states have (on average 1.4359504132231404) internal successors, (4170), 2904 states have internal predecessors, (4170), 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:48:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4170 transitions. [2025-01-09 04:48:53,986 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4170 transitions. Word has length 73 [2025-01-09 04:48:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:53,986 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 4170 transitions. [2025-01-09 04:48:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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:48:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4170 transitions. [2025-01-09 04:48:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:48:53,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:53,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:48:53,987 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:53,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1282791167, now seen corresponding path program 1 times [2025-01-09 04:48:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:53,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790176196] [2025-01-09 04:48:53,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:48:54,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:48:54,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:54,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790176196] [2025-01-09 04:48:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790176196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:48:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160005350] [2025-01-09 04:48:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:48:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:48:54,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:48:54,053 INFO L87 Difference]: Start difference. First operand 2905 states and 4170 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:48:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:54,073 INFO L93 Difference]: Finished difference Result 6167 states and 8889 transitions. [2025-01-09 04:48:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:48:54,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:48:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:54,079 INFO L225 Difference]: With dead ends: 6167 [2025-01-09 04:48:54,079 INFO L226 Difference]: Without dead ends: 4131 [2025-01-09 04:48:54,082 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:48:54,082 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:54,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 320 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-01-09 04:48:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 3945. [2025-01-09 04:48:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3945 states, 3944 states have (on average 1.4269776876267748) internal successors, (5628), 3944 states have internal predecessors, (5628), 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:48:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 5628 transitions. [2025-01-09 04:48:54,118 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 5628 transitions. Word has length 97 [2025-01-09 04:48:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:54,118 INFO L471 AbstractCegarLoop]: Abstraction has 3945 states and 5628 transitions. [2025-01-09 04:48:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:48:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 5628 transitions. [2025-01-09 04:48:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:48:54,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:54,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:48:54,119 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1136033977, now seen corresponding path program 1 times [2025-01-09 04:48:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460184426] [2025-01-09 04:48:54,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:54,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:48:54,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:48:54,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:54,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460184426] [2025-01-09 04:48:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460184426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344935528] [2025-01-09 04:48:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:54,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:48:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:54,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:48:54,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:54,198 INFO L87 Difference]: Start difference. First operand 3945 states and 5628 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:54,382 INFO L93 Difference]: Finished difference Result 13309 states and 19184 transitions. [2025-01-09 04:48:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:48:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:54,397 INFO L225 Difference]: With dead ends: 13309 [2025-01-09 04:48:54,397 INFO L226 Difference]: Without dead ends: 9467 [2025-01-09 04:48:54,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:48:54,402 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 711 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:54,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 268 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2025-01-09 04:48:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 8625. [2025-01-09 04:48:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8625 states, 8624 states have (on average 1.4286873840445269) internal successors, (12321), 8624 states have internal predecessors, (12321), 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:48:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8625 states to 8625 states and 12321 transitions. [2025-01-09 04:48:54,477 INFO L78 Accepts]: Start accepts. Automaton has 8625 states and 12321 transitions. Word has length 99 [2025-01-09 04:48:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:54,477 INFO L471 AbstractCegarLoop]: Abstraction has 8625 states and 12321 transitions. [2025-01-09 04:48:54,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8625 states and 12321 transitions. [2025-01-09 04:48:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:48:54,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:54,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:48:54,479 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:54,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash -713465523, now seen corresponding path program 1 times [2025-01-09 04:48:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:54,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869849157] [2025-01-09 04:48:54,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:54,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:48:54,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:48:54,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:54,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869849157] [2025-01-09 04:48:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869849157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:54,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502071497] [2025-01-09 04:48:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:54,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:48:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:54,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:48:54,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:54,626 INFO L87 Difference]: Start difference. First operand 8625 states and 12321 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:54,875 INFO L93 Difference]: Finished difference Result 31381 states and 45311 transitions. [2025-01-09 04:48:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:48:54,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:54,912 INFO L225 Difference]: With dead ends: 31381 [2025-01-09 04:48:54,913 INFO L226 Difference]: Without dead ends: 22859 [2025-01-09 04:48:54,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:48:54,927 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 796 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:54,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 270 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22859 states. [2025-01-09 04:48:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22859 to 18825. [2025-01-09 04:48:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18825 states, 18824 states have (on average 1.4281236719082022) internal successors, (26883), 18824 states have internal predecessors, (26883), 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:48:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18825 states to 18825 states and 26883 transitions. [2025-01-09 04:48:55,149 INFO L78 Accepts]: Start accepts. Automaton has 18825 states and 26883 transitions. Word has length 99 [2025-01-09 04:48:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:55,149 INFO L471 AbstractCegarLoop]: Abstraction has 18825 states and 26883 transitions. [2025-01-09 04:48:55,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18825 states and 26883 transitions. [2025-01-09 04:48:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:48:55,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:55,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:48:55,150 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:55,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 748112851, now seen corresponding path program 1 times [2025-01-09 04:48:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938948078] [2025-01-09 04:48:55,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:55,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:48:55,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:48:55,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938948078] [2025-01-09 04:48:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938948078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:48:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455759282] [2025-01-09 04:48:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:48:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:55,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:48:55,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:48:55,235 INFO L87 Difference]: Start difference. First operand 18825 states and 26883 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:55,479 INFO L93 Difference]: Finished difference Result 42655 states and 61170 transitions. [2025-01-09 04:48:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:48:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:55,513 INFO L225 Difference]: With dead ends: 42655 [2025-01-09 04:48:55,513 INFO L226 Difference]: Without dead ends: 23933 [2025-01-09 04:48:55,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:48:55,531 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 720 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:55,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 304 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:48:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23933 states. [2025-01-09 04:48:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23933 to 20427. [2025-01-09 04:48:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20427 states, 20426 states have (on average 1.4250465093508273) internal successors, (29108), 20426 states have internal predecessors, (29108), 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:48:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20427 states to 20427 states and 29108 transitions. [2025-01-09 04:48:55,853 INFO L78 Accepts]: Start accepts. Automaton has 20427 states and 29108 transitions. Word has length 99 [2025-01-09 04:48:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:55,853 INFO L471 AbstractCegarLoop]: Abstraction has 20427 states and 29108 transitions. [2025-01-09 04:48:55,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 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:48:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20427 states and 29108 transitions. [2025-01-09 04:48:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:48:55,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:55,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:48:55,858 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 155619384, now seen corresponding path program 1 times [2025-01-09 04:48:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561549194] [2025-01-09 04:48:55,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:55,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:48:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:48:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:48:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561549194] [2025-01-09 04:48:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561549194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:48:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610847494] [2025-01-09 04:48:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:48:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:55,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:48:55,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:48:55,930 INFO L87 Difference]: Start difference. First operand 20427 states and 29108 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:48:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:56,001 INFO L93 Difference]: Finished difference Result 38959 states and 55378 transitions. [2025-01-09 04:48:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:48:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 122 [2025-01-09 04:48:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:56,026 INFO L225 Difference]: With dead ends: 38959 [2025-01-09 04:48:56,027 INFO L226 Difference]: Without dead ends: 18647 [2025-01-09 04:48:56,043 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:48:56,043 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:56,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 311 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2025-01-09 04:48:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 18105. [2025-01-09 04:48:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18105 states, 18104 states have (on average 1.4064847547503314) internal successors, (25463), 18104 states have internal predecessors, (25463), 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:48:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18105 states to 18105 states and 25463 transitions. [2025-01-09 04:48:56,418 INFO L78 Accepts]: Start accepts. Automaton has 18105 states and 25463 transitions. Word has length 122 [2025-01-09 04:48:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 18105 states and 25463 transitions. [2025-01-09 04:48:56,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:48:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18105 states and 25463 transitions. [2025-01-09 04:48:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 04:48:56,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:56,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:48:56,423 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:56,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2025959497, now seen corresponding path program 1 times [2025-01-09 04:48:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804849986] [2025-01-09 04:48:56,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:56,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 04:48:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 04:48:56,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:56,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:48:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804849986] [2025-01-09 04:48:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804849986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:56,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:48:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688476619] [2025-01-09 04:48:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:48:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:56,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:48:56,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:48:56,633 INFO L87 Difference]: Start difference. First operand 18105 states and 25463 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:48:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:56,693 INFO L93 Difference]: Finished difference Result 34345 states and 48129 transitions. [2025-01-09 04:48:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:48:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 123 [2025-01-09 04:48:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:56,710 INFO L225 Difference]: With dead ends: 34345 [2025-01-09 04:48:56,710 INFO L226 Difference]: Without dead ends: 16343 [2025-01-09 04:48:56,722 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:48:56,723 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:56,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16343 states. [2025-01-09 04:48:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16343 to 15837. [2025-01-09 04:48:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15837 states, 15836 states have (on average 1.385135135135135) internal successors, (21935), 15836 states have internal predecessors, (21935), 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:48:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 21935 transitions. [2025-01-09 04:48:56,922 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 21935 transitions. Word has length 123 [2025-01-09 04:48:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:56,923 INFO L471 AbstractCegarLoop]: Abstraction has 15837 states and 21935 transitions. [2025-01-09 04:48:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:48:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 21935 transitions. [2025-01-09 04:48:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:48:56,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:56,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:48:56,926 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:56,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1620536471, now seen corresponding path program 1 times [2025-01-09 04:48:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981795814] [2025-01-09 04:48:56,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:56,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:48:56,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:48:56,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:48:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981795814] [2025-01-09 04:48:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981795814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:48:57,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:48:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:48:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077485405] [2025-01-09 04:48:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:48:57,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:48:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:48:57,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:48:57,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:48:57,030 INFO L87 Difference]: Start difference. First operand 15837 states and 21935 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:48:57,115 INFO L93 Difference]: Finished difference Result 45457 states and 62561 transitions. [2025-01-09 04:48:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:48:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:48:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:48:57,153 INFO L225 Difference]: With dead ends: 45457 [2025-01-09 04:48:57,153 INFO L226 Difference]: Without dead ends: 29723 [2025-01-09 04:48:57,170 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:48:57,170 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 45 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:48:57,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:48:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29723 states. [2025-01-09 04:48:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29723 to 27369. [2025-01-09 04:48:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27369 states, 27368 states have (on average 1.3656460099386145) internal successors, (37375), 27368 states have internal predecessors, (37375), 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:48:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27369 states to 27369 states and 37375 transitions. [2025-01-09 04:48:57,532 INFO L78 Accepts]: Start accepts. Automaton has 27369 states and 37375 transitions. Word has length 124 [2025-01-09 04:48:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:48:57,532 INFO L471 AbstractCegarLoop]: Abstraction has 27369 states and 37375 transitions. [2025-01-09 04:48:57,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:48:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27369 states and 37375 transitions. [2025-01-09 04:48:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:48:57,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:48:57,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:48:57,536 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:48:57,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:48:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1131627674, now seen corresponding path program 1 times [2025-01-09 04:48:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:48:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134928401] [2025-01-09 04:48:57,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:48:57,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:48:57,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:48:57,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:48:58,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:48:58,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134928401] [2025-01-09 04:48:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134928401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:48:58,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307196757] [2025-01-09 04:48:58,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:48:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:48:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:48:58,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:48:58,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:48:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:48:58,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:48:58,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:48:58,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:48:58,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 04:48:58,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:49:04,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:49:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307196757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:49:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [11] total 39 [2025-01-09 04:49:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764717349] [2025-01-09 04:49:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:49:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:49:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:49:04,199 INFO L87 Difference]: Start difference. First operand 27369 states and 37375 transitions. Second operand has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 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:49:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:10,890 INFO L93 Difference]: Finished difference Result 79345 states and 108417 transitions. [2025-01-09 04:49:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 04:49:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 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 125 [2025-01-09 04:49:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:10,996 INFO L225 Difference]: With dead ends: 79345 [2025-01-09 04:49:10,999 INFO L226 Difference]: Without dead ends: 54665 [2025-01-09 04:49:11,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=451, Invalid=2519, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 04:49:11,056 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 403 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:11,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 964 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:49:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54665 states. [2025-01-09 04:49:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54665 to 27377. [2025-01-09 04:49:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27377 states, 27376 states have (on average 1.3655756867329047) internal successors, (37384), 27376 states have internal predecessors, (37384), 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:49:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27377 states to 27377 states and 37384 transitions. [2025-01-09 04:49:11,614 INFO L78 Accepts]: Start accepts. Automaton has 27377 states and 37384 transitions. Word has length 125 [2025-01-09 04:49:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:11,614 INFO L471 AbstractCegarLoop]: Abstraction has 27377 states and 37384 transitions. [2025-01-09 04:49:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 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:49:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27377 states and 37384 transitions. [2025-01-09 04:49:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:49:11,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:11,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:49:11,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:11,822 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:49:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 127944595, now seen corresponding path program 1 times [2025-01-09 04:49:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167440694] [2025-01-09 04:49:11,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:11,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167440694] [2025-01-09 04:49:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167440694] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210375704] [2025-01-09 04:49:12,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:12,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:12,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:12,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:12,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:49:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:12,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:12,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:12,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:49:12,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:13,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:14,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210375704] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:14,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2025-01-09 04:49:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019886045] [2025-01-09 04:49:14,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:14,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:49:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:14,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:49:14,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:49:14,528 INFO L87 Difference]: Start difference. First operand 27377 states and 37384 transitions. Second operand has 29 states, 29 states have (on average 11.344827586206897) internal successors, (329), 28 states have internal predecessors, (329), 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:49:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:17,753 INFO L93 Difference]: Finished difference Result 179195 states and 242260 transitions. [2025-01-09 04:49:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 04:49:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.344827586206897) internal successors, (329), 28 states have internal predecessors, (329), 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 126 [2025-01-09 04:49:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:17,935 INFO L225 Difference]: With dead ends: 179195 [2025-01-09 04:49:17,935 INFO L226 Difference]: Without dead ends: 151929 [2025-01-09 04:49:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1715, Invalid=5767, Unknown=0, NotChecked=0, Total=7482 [2025-01-09 04:49:17,989 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2645 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:17,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 1696 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:49:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151929 states. [2025-01-09 04:49:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151929 to 65519. [2025-01-09 04:49:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65519 states, 65518 states have (on average 1.3615189718855887) internal successors, (89204), 65518 states have internal predecessors, (89204), 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:49:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65519 states to 65519 states and 89204 transitions. [2025-01-09 04:49:19,088 INFO L78 Accepts]: Start accepts. Automaton has 65519 states and 89204 transitions. Word has length 126 [2025-01-09 04:49:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:19,088 INFO L471 AbstractCegarLoop]: Abstraction has 65519 states and 89204 transitions. [2025-01-09 04:49:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.344827586206897) internal successors, (329), 28 states have internal predecessors, (329), 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:49:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 65519 states and 89204 transitions. [2025-01-09 04:49:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:49:19,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:19,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:49:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:19,298 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:49:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash -612030348, now seen corresponding path program 1 times [2025-01-09 04:49:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671581703] [2025-01-09 04:49:19,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:19,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:19,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:19,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:19,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671581703] [2025-01-09 04:49:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671581703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109882832] [2025-01-09 04:49:20,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:20,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:20,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:49:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:20,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:20,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:20,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:20,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:49:20,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:20,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109882832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:22,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-01-09 04:49:22,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537809813] [2025-01-09 04:49:22,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:22,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:49:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:22,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:49:22,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:49:22,062 INFO L87 Difference]: Start difference. First operand 65519 states and 89204 transitions. Second operand has 32 states, 32 states have (on average 10.6875) internal successors, (342), 31 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:33,162 INFO L93 Difference]: Finished difference Result 578112 states and 779011 transitions. [2025-01-09 04:49:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-01-09 04:49:33,162 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.6875) internal successors, (342), 31 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:49:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:33,996 INFO L225 Difference]: With dead ends: 578112 [2025-01-09 04:49:33,996 INFO L226 Difference]: Without dead ends: 512734 [2025-01-09 04:49:34,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10634 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4730, Invalid=28212, Unknown=0, NotChecked=0, Total=32942 [2025-01-09 04:49:34,067 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 2988 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 4676 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2988 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 4729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:34,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2988 Valid, 3491 Invalid, 4729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4676 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:49:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512734 states. [2025-01-09 04:49:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512734 to 317638. [2025-01-09 04:49:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317638 states, 317637 states have (on average 1.353104329785258) internal successors, (429796), 317637 states have internal predecessors, (429796), 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:49:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317638 states to 317638 states and 429796 transitions. [2025-01-09 04:49:39,926 INFO L78 Accepts]: Start accepts. Automaton has 317638 states and 429796 transitions. Word has length 126 [2025-01-09 04:49:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:39,926 INFO L471 AbstractCegarLoop]: Abstraction has 317638 states and 429796 transitions. [2025-01-09 04:49:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.6875) internal successors, (342), 31 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 317638 states and 429796 transitions. [2025-01-09 04:49:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:49:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:39,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:49:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:40,149 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:49:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash -887349454, now seen corresponding path program 1 times [2025-01-09 04:49:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751761659] [2025-01-09 04:49:40,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:40,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:40,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:40,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:40,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751761659] [2025-01-09 04:49:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751761659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657714946] [2025-01-09 04:49:40,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:40,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:40,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:40,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:49:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:49:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:49:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:40,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:49:40,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:41,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:43,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657714946] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:43,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-01-09 04:49:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679784374] [2025-01-09 04:49:43,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:43,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:49:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:43,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:49:43,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:49:43,569 INFO L87 Difference]: Start difference. First operand 317638 states and 429796 transitions. Second operand has 29 states, 29 states have (on average 11.96551724137931) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:55,857 INFO L93 Difference]: Finished difference Result 1656401 states and 2229299 transitions. [2025-01-09 04:49:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-01-09 04:49:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.96551724137931) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-09 04:49:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:58,393 INFO L225 Difference]: With dead ends: 1656401 [2025-01-09 04:49:58,393 INFO L226 Difference]: Without dead ends: 1348021 [2025-01-09 04:49:58,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11779 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4113, Invalid=30297, Unknown=0, NotChecked=0, Total=34410 [2025-01-09 04:49:58,601 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 3717 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3717 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:58,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3717 Valid, 2839 Invalid, 5513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 5452 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:49:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348021 states.