./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-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 740290dda5575272bb23cb8f59f476bbd4d0eb4eae1c4b42019e214336dbab38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:44:13,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:44:13,759 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:44:13,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:44:13,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:44:13,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:44:13,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:44:13,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:44:13,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:44:13,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:44:13,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:44:13,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:44:13,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:44:13,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:44:13,783 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:44:13,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:44:13,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:44:13,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:13,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:13,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:13,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:44:13,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:44:13,786 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 -> 740290dda5575272bb23cb8f59f476bbd4d0eb4eae1c4b42019e214336dbab38 [2025-01-09 04:44:13,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:44:13,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:44:13,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:44:13,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:44:13,983 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:44:13,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-01-09 04:44:15,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cf7a8dac/d9786bab964b4c29bbe638dbc7236d9d/FLAG45fe94d62 [2025-01-09 04:44:15,587 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:44:15,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-01-09 04:44:15,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cf7a8dac/d9786bab964b4c29bbe638dbc7236d9d/FLAG45fe94d62 [2025-01-09 04:44:15,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cf7a8dac/d9786bab964b4c29bbe638dbc7236d9d [2025-01-09 04:44:15,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:44:15,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:44:15,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:15,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:44:15,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:44:15,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15, skipping insertion in model container [2025-01-09 04:44:15,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:44:15,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[6322,6335] [2025-01-09 04:44:15,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:15,890 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:44:15,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[6322,6335] [2025-01-09 04:44:15,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:15,938 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:44:15,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15 WrapperNode [2025-01-09 04:44:15,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:15,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:15,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:44:15,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:44:15,944 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:44:15" (1/1) ... [2025-01-09 04:44:15,950 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:44:15" (1/1) ... [2025-01-09 04:44:15,970 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 578 [2025-01-09 04:44:15,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:15,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:44:15,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:44:15,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:44:15,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,991 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:44:15,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:15,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:16,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:16,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:16,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:16,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:44:16,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:44:16,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:44:16,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:44:16,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (1/1) ... [2025-01-09 04:44:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:16,038 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:44:16,043 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:44:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:44:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:44:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:44:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:44:16,148 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:44:16,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:44:16,632 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-01-09 04:44:16,632 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:44:16,646 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:44:16,646 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:44:16,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:16 BoogieIcfgContainer [2025-01-09 04:44:16,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:44:16,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:44:16,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:44:16,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:44:16,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:15" (1/3) ... [2025-01-09 04:44:16,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dec5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:16, skipping insertion in model container [2025-01-09 04:44:16,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:15" (2/3) ... [2025-01-09 04:44:16,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dec5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:16, skipping insertion in model container [2025-01-09 04:44:16,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:16" (3/3) ... [2025-01-09 04:44:16,661 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-01-09 04:44:16,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:44:16,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c that has 1 procedures, 136 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:44:16,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:44:16,738 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;@533f45fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:44:16,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:44:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 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:44:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:44:16,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:16,750 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] [2025-01-09 04:44:16,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -793823884, now seen corresponding path program 1 times [2025-01-09 04:44:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261120731] [2025-01-09 04:44:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:16,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:44:16,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:44:16,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:16,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,143 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:44:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261120731] [2025-01-09 04:44:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261120731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315604810] [2025-01-09 04:44:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:17,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:17,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:17,170 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 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 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:44:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,214 INFO L93 Difference]: Finished difference Result 322 states and 522 transitions. [2025-01-09 04:44:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-01-09 04:44:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,221 INFO L225 Difference]: With dead ends: 322 [2025-01-09 04:44:17,222 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 04:44:17,224 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:44:17,226 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 174 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 504 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 04:44:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2025-01-09 04:44:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.5047169811320755) internal successors, (319), 212 states have internal predecessors, (319), 0 states have call successors, (0), 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:44:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 319 transitions. [2025-01-09 04:44:17,292 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 319 transitions. Word has length 60 [2025-01-09 04:44:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 319 transitions. [2025-01-09 04:44:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:44:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 319 transitions. [2025-01-09 04:44:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:44:17,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,294 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] [2025-01-09 04:44:17,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:44:17,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1200786689, now seen corresponding path program 1 times [2025-01-09 04:44:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037413419] [2025-01-09 04:44:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:44:17,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:44:17,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,449 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:44:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037413419] [2025-01-09 04:44:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037413419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908379986] [2025-01-09 04:44:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:17,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:17,451 INFO L87 Difference]: Start difference. First operand 213 states and 319 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:44:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,500 INFO L93 Difference]: Finished difference Result 537 states and 835 transitions. [2025-01-09 04:44:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-01-09 04:44:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,502 INFO L225 Difference]: With dead ends: 537 [2025-01-09 04:44:17,502 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 04:44:17,506 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:44:17,507 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 139 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 04:44:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2025-01-09 04:44:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.5393258426966292) internal successors, (548), 356 states have internal predecessors, (548), 0 states have call successors, (0), 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:44:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-01-09 04:44:17,536 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 61 [2025-01-09 04:44:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-01-09 04:44:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:44:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-01-09 04:44:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:44:17,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,538 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:44:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:44:17,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1872640227, now seen corresponding path program 1 times [2025-01-09 04:44:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273818637] [2025-01-09 04:44:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:44:17,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:44:17,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,682 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:44:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273818637] [2025-01-09 04:44:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273818637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138386107] [2025-01-09 04:44:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:17,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:17,685 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:44:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,716 INFO L93 Difference]: Finished difference Result 937 states and 1470 transitions. [2025-01-09 04:44:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:17,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:44:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,719 INFO L225 Difference]: With dead ends: 937 [2025-01-09 04:44:17,719 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 04:44:17,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:44:17,722 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 134 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 428 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 04:44:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 613. [2025-01-09 04:44:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.5555555555555556) internal successors, (952), 612 states have internal predecessors, (952), 0 states have call successors, (0), 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:44:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 952 transitions. [2025-01-09 04:44:17,746 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 952 transitions. Word has length 62 [2025-01-09 04:44:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 952 transitions. [2025-01-09 04:44:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:44:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 952 transitions. [2025-01-09 04:44:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:44:17,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,747 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] [2025-01-09 04:44:17,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:44:17,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:17,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash -562045070, now seen corresponding path program 1 times [2025-01-09 04:44:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324061741] [2025-01-09 04:44:17,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:44:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:44:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,838 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:44:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324061741] [2025-01-09 04:44:17,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324061741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105944151] [2025-01-09 04:44:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:17,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:17,841 INFO L87 Difference]: Start difference. First operand 613 states and 952 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:44:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,870 INFO L93 Difference]: Finished difference Result 1641 states and 2578 transitions. [2025-01-09 04:44:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:17,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 04:44:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,874 INFO L225 Difference]: With dead ends: 1641 [2025-01-09 04:44:17,875 INFO L226 Difference]: Without dead ends: 1063 [2025-01-09 04:44:17,877 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:44:17,878 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 129 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-01-09 04:44:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2025-01-09 04:44:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.558490566037736) internal successors, (1652), 1060 states have internal predecessors, (1652), 0 states have call successors, (0), 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:44:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1652 transitions. [2025-01-09 04:44:17,932 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1652 transitions. Word has length 63 [2025-01-09 04:44:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,932 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1652 transitions. [2025-01-09 04:44:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:44:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1652 transitions. [2025-01-09 04:44:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:17,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,933 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:44:17,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:44:17,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:17,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1925116710, now seen corresponding path program 1 times [2025-01-09 04:44:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16348880] [2025-01-09 04:44:17,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:17,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:17,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:18,010 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:44:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16348880] [2025-01-09 04:44:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16348880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298910501] [2025-01-09 04:44:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:18,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:18,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:18,012 INFO L87 Difference]: Start difference. First operand 1061 states and 1652 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:44:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,037 INFO L93 Difference]: Finished difference Result 2857 states and 4470 transitions. [2025-01-09 04:44:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:18,038 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:44:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,043 INFO L225 Difference]: With dead ends: 2857 [2025-01-09 04:44:18,043 INFO L226 Difference]: Without dead ends: 1831 [2025-01-09 04:44:18,045 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:44:18,045 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:18,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-01-09 04:44:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2025-01-09 04:44:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.5514223194748358) internal successors, (2836), 1828 states have internal predecessors, (2836), 0 states have call successors, (0), 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:44:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2836 transitions. [2025-01-09 04:44:18,076 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2836 transitions. Word has length 64 [2025-01-09 04:44:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:18,076 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2836 transitions. [2025-01-09 04:44:18,077 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:44:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2836 transitions. [2025-01-09 04:44:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:44:18,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:18,077 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:44:18,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:44:18,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 210559993, now seen corresponding path program 1 times [2025-01-09 04:44:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726983664] [2025-01-09 04:44:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:44:18,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:44:18,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:18,293 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:44:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:18,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726983664] [2025-01-09 04:44:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726983664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:18,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243469465] [2025-01-09 04:44:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:18,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:18,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:18,296 INFO L87 Difference]: Start difference. First operand 1829 states and 2836 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:44:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,465 INFO L93 Difference]: Finished difference Result 12593 states and 19642 transitions. [2025-01-09 04:44:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:44:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,497 INFO L225 Difference]: With dead ends: 12593 [2025-01-09 04:44:18,498 INFO L226 Difference]: Without dead ends: 10799 [2025-01-09 04:44:18,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:18,504 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 2059 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:18,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 1257 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2025-01-09 04:44:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 3621. [2025-01-09 04:44:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3620 states have (on average 1.5392265193370165) internal successors, (5572), 3620 states have internal predecessors, (5572), 0 states have call successors, (0), 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:44:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 5572 transitions. [2025-01-09 04:44:18,611 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 5572 transitions. Word has length 65 [2025-01-09 04:44:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:18,612 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 5572 transitions. [2025-01-09 04:44:18,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:44:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 5572 transitions. [2025-01-09 04:44:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:18,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:18,613 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:44:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:44:18,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2082031049, now seen corresponding path program 1 times [2025-01-09 04:44:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606876291] [2025-01-09 04:44:18,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:18,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:18,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:18,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:18,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:18,794 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:44:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:18,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606876291] [2025-01-09 04:44:18,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606876291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:18,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:18,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729443285] [2025-01-09 04:44:18,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:18,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:18,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:18,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:18,797 INFO L87 Difference]: Start difference. First operand 3621 states and 5572 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:44:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,946 INFO L93 Difference]: Finished difference Result 18831 states and 28777 transitions. [2025-01-09 04:44:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:44:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,987 INFO L225 Difference]: With dead ends: 18831 [2025-01-09 04:44:18,987 INFO L226 Difference]: Without dead ends: 15245 [2025-01-09 04:44:18,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:18,996 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 624 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:18,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1313 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15245 states. [2025-01-09 04:44:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15245 to 15237. [2025-01-09 04:44:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15237 states, 15236 states have (on average 1.520871619847729) internal successors, (23172), 15236 states have internal predecessors, (23172), 0 states have call successors, (0), 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:44:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 23172 transitions. [2025-01-09 04:44:19,292 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 23172 transitions. Word has length 66 [2025-01-09 04:44:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 15237 states and 23172 transitions. [2025-01-09 04:44:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:44:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 23172 transitions. [2025-01-09 04:44:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:19,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,293 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:44:19,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:44:19,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash 254256256, now seen corresponding path program 1 times [2025-01-09 04:44:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917300191] [2025-01-09 04:44:19,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:19,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:19,460 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:44:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917300191] [2025-01-09 04:44:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917300191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:19,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:19,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13539797] [2025-01-09 04:44:19,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:19,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:19,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:19,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:19,462 INFO L87 Difference]: Start difference. First operand 15237 states and 23172 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:44:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:19,719 INFO L93 Difference]: Finished difference Result 45641 states and 69446 transitions. [2025-01-09 04:44:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:19,719 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:44:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:19,776 INFO L225 Difference]: With dead ends: 45641 [2025-01-09 04:44:19,776 INFO L226 Difference]: Without dead ends: 30439 [2025-01-09 04:44:19,801 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:44:19,802 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 828 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:19,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 212 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30439 states. [2025-01-09 04:44:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30439 to 30437. [2025-01-09 04:44:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30437 states, 30436 states have (on average 1.5120252332763833) internal successors, (46020), 30436 states have internal predecessors, (46020), 0 states have call successors, (0), 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:44:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30437 states to 30437 states and 46020 transitions. [2025-01-09 04:44:20,420 INFO L78 Accepts]: Start accepts. Automaton has 30437 states and 46020 transitions. Word has length 68 [2025-01-09 04:44:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:20,421 INFO L471 AbstractCegarLoop]: Abstraction has 30437 states and 46020 transitions. [2025-01-09 04:44:20,421 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:44:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 30437 states and 46020 transitions. [2025-01-09 04:44:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:20,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:20,423 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:44:20,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:44:20,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:20,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1142699675, now seen corresponding path program 1 times [2025-01-09 04:44:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-01-09 04:44:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:20,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:20,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:20,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:20,727 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:44:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-01-09 04:44:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368575808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:20,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:44:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955990888] [2025-01-09 04:44:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:20,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:20,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:20,729 INFO L87 Difference]: Start difference. First operand 30437 states and 46020 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:44:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,848 INFO L93 Difference]: Finished difference Result 31719 states and 47941 transitions. [2025-01-09 04:44:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:44:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,978 INFO L225 Difference]: With dead ends: 31719 [2025-01-09 04:44:20,983 INFO L226 Difference]: Without dead ends: 31717 [2025-01-09 04:44:20,993 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:44:20,994 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:20,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 741 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31717 states. [2025-01-09 04:44:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31717 to 31717. [2025-01-09 04:44:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31717 states, 31716 states have (on average 1.4913608273426662) internal successors, (47300), 31716 states have internal predecessors, (47300), 0 states have call successors, (0), 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:44:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31717 states to 31717 states and 47300 transitions. [2025-01-09 04:44:21,526 INFO L78 Accepts]: Start accepts. Automaton has 31717 states and 47300 transitions. Word has length 68 [2025-01-09 04:44:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:21,527 INFO L471 AbstractCegarLoop]: Abstraction has 31717 states and 47300 transitions. [2025-01-09 04:44:21,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:44:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31717 states and 47300 transitions. [2025-01-09 04:44:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:21,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:21,528 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:44:21,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:44:21,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:21,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1053378469, now seen corresponding path program 1 times [2025-01-09 04:44:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:21,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413428948] [2025-01-09 04:44:21,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:21,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:21,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:21,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:21,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:21,606 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:44:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413428948] [2025-01-09 04:44:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413428948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:21,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955388872] [2025-01-09 04:44:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:21,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:21,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:21,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:21,607 INFO L87 Difference]: Start difference. First operand 31717 states and 47300 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:44:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:21,817 INFO L93 Difference]: Finished difference Result 70715 states and 105272 transitions. [2025-01-09 04:44:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:21,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:44:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:21,870 INFO L225 Difference]: With dead ends: 70715 [2025-01-09 04:44:21,870 INFO L226 Difference]: Without dead ends: 39033 [2025-01-09 04:44:21,892 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:44:21,893 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 112 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:21,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 385 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39033 states. [2025-01-09 04:44:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39033 to 39031. [2025-01-09 04:44:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39031 states, 39030 states have (on average 1.4825006405329233) internal successors, (57862), 39030 states have internal predecessors, (57862), 0 states have call successors, (0), 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:44:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39031 states to 39031 states and 57862 transitions. [2025-01-09 04:44:22,331 INFO L78 Accepts]: Start accepts. Automaton has 39031 states and 57862 transitions. Word has length 69 [2025-01-09 04:44:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:22,331 INFO L471 AbstractCegarLoop]: Abstraction has 39031 states and 57862 transitions. [2025-01-09 04:44:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:44:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 39031 states and 57862 transitions. [2025-01-09 04:44:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:44:22,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:22,342 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:22,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:44:22,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash -212554062, now seen corresponding path program 1 times [2025-01-09 04:44:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:22,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099499247] [2025-01-09 04:44:22,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:22,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:44:22,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:44:22,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:22,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:44:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099499247] [2025-01-09 04:44:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099499247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544567028] [2025-01-09 04:44:22,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:22,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:22,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:22,514 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:44:22,633 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:44:22,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:44:22,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:44:22,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:22,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:22,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:44:22,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:23,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:44:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544567028] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:44:23,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:44:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2025-01-09 04:44:23,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882385401] [2025-01-09 04:44:23,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:44:23,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:44:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:23,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:44:23,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:44:23,894 INFO L87 Difference]: Start difference. First operand 39031 states and 57862 transitions. Second operand has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 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:44:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:24,717 INFO L93 Difference]: Finished difference Result 201706 states and 300292 transitions. [2025-01-09 04:44:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:44:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 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 94 [2025-01-09 04:44:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:25,183 INFO L225 Difference]: With dead ends: 201706 [2025-01-09 04:44:25,183 INFO L226 Difference]: Without dead ends: 162712 [2025-01-09 04:44:25,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:44:25,223 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 4283 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:25,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 2286 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162712 states. [2025-01-09 04:44:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162712 to 140932. [2025-01-09 04:44:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140932 states, 140931 states have (on average 1.4763749636346866) internal successors, (208067), 140931 states have internal predecessors, (208067), 0 states have call successors, (0), 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:44:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140932 states to 140932 states and 208067 transitions. [2025-01-09 04:44:27,810 INFO L78 Accepts]: Start accepts. Automaton has 140932 states and 208067 transitions. Word has length 94 [2025-01-09 04:44:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 140932 states and 208067 transitions. [2025-01-09 04:44:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 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:44:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 140932 states and 208067 transitions. [2025-01-09 04:44:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:27,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:27,817 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:27,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:44:28,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 04:44:28,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:28,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1806159814, now seen corresponding path program 1 times [2025-01-09 04:44:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:28,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-01-09 04:44:28,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:28,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:28,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:28,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:28,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-01-09 04:44:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027359389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:28,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762445865] [2025-01-09 04:44:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:28,087 INFO L87 Difference]: Start difference. First operand 140932 states and 208067 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:28,371 INFO L93 Difference]: Finished difference Result 190019 states and 280223 transitions. [2025-01-09 04:44:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:28,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:44:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:28,830 INFO L225 Difference]: With dead ends: 190019 [2025-01-09 04:44:28,830 INFO L226 Difference]: Without dead ends: 143619 [2025-01-09 04:44:28,879 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:44:28,880 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:28,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 442 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143619 states. [2025-01-09 04:44:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143619 to 140975. [2025-01-09 04:44:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140975 states, 140974 states have (on average 1.4561408486671301) internal successors, (205278), 140974 states have internal predecessors, (205278), 0 states have call successors, (0), 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:44:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140975 states to 140975 states and 205278 transitions. [2025-01-09 04:44:30,930 INFO L78 Accepts]: Start accepts. Automaton has 140975 states and 205278 transitions. Word has length 95 [2025-01-09 04:44:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:30,930 INFO L471 AbstractCegarLoop]: Abstraction has 140975 states and 205278 transitions. [2025-01-09 04:44:30,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 140975 states and 205278 transitions. [2025-01-09 04:44:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:30,937 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:30,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:44:30,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:30,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -612124705, now seen corresponding path program 1 times [2025-01-09 04:44:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:30,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669435586] [2025-01-09 04:44:30,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:30,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:30,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:30,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:30,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669435586] [2025-01-09 04:44:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669435586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:31,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090657033] [2025-01-09 04:44:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:31,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:31,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:31,010 INFO L87 Difference]: Start difference. First operand 140975 states and 205278 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:31,922 INFO L93 Difference]: Finished difference Result 249006 states and 363159 transitions. [2025-01-09 04:44:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:44:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:32,116 INFO L225 Difference]: With dead ends: 249006 [2025-01-09 04:44:32,116 INFO L226 Difference]: Without dead ends: 179995 [2025-01-09 04:44:32,151 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:44:32,151 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:32,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 423 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179995 states. [2025-01-09 04:44:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179995 to 173637. [2025-01-09 04:44:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173637 states, 173636 states have (on average 1.4407323366122233) internal successors, (250163), 173636 states have internal predecessors, (250163), 0 states have call successors, (0), 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:44:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173637 states to 173637 states and 250163 transitions. [2025-01-09 04:44:34,237 INFO L78 Accepts]: Start accepts. Automaton has 173637 states and 250163 transitions. Word has length 95 [2025-01-09 04:44:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:34,237 INFO L471 AbstractCegarLoop]: Abstraction has 173637 states and 250163 transitions. [2025-01-09 04:44:34,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 173637 states and 250163 transitions. [2025-01-09 04:44:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:34,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:34,246 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:34,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:44:34,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1563633886, now seen corresponding path program 1 times [2025-01-09 04:44:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899599872] [2025-01-09 04:44:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:34,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:34,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:34,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899599872] [2025-01-09 04:44:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899599872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927193133] [2025-01-09 04:44:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:34,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:34,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:34,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:34,349 INFO L87 Difference]: Start difference. First operand 173637 states and 250163 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:35,561 INFO L93 Difference]: Finished difference Result 395605 states and 570577 transitions. [2025-01-09 04:44:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:44:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:35,986 INFO L225 Difference]: With dead ends: 395605 [2025-01-09 04:44:35,986 INFO L226 Difference]: Without dead ends: 268818 [2025-01-09 04:44:36,111 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:44:36,112 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 115 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:36,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268818 states. [2025-01-09 04:44:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268818 to 263270. [2025-01-09 04:44:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263270 states, 263269 states have (on average 1.4274145455788565) internal successors, (375794), 263269 states have internal predecessors, (375794), 0 states have call successors, (0), 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:44:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263270 states to 263270 states and 375794 transitions. [2025-01-09 04:44:39,875 INFO L78 Accepts]: Start accepts. Automaton has 263270 states and 375794 transitions. Word has length 95 [2025-01-09 04:44:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:39,875 INFO L471 AbstractCegarLoop]: Abstraction has 263270 states and 375794 transitions. [2025-01-09 04:44:39,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 263270 states and 375794 transitions. [2025-01-09 04:44:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:39,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:39,886 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:44:39,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:39,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 625845135, now seen corresponding path program 1 times [2025-01-09 04:44:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699407050] [2025-01-09 04:44:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:39,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:39,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:39,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:39,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699407050] [2025-01-09 04:44:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699407050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959978121] [2025-01-09 04:44:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:39,950 INFO L87 Difference]: Start difference. First operand 263270 states and 375794 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:42,025 INFO L93 Difference]: Finished difference Result 698527 states and 994822 transitions. [2025-01-09 04:44:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:44:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:43,267 INFO L225 Difference]: With dead ends: 698527 [2025-01-09 04:44:43,267 INFO L226 Difference]: Without dead ends: 456691 [2025-01-09 04:44:43,325 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:44:43,327 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 114 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:43,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 385 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456691 states. [2025-01-09 04:44:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456691 to 452711. [2025-01-09 04:44:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452711 states, 452710 states have (on average 1.4100881358927349) internal successors, (638361), 452710 states have internal predecessors, (638361), 0 states have call successors, (0), 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:44:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452711 states to 452711 states and 638361 transitions. [2025-01-09 04:44:49,431 INFO L78 Accepts]: Start accepts. Automaton has 452711 states and 638361 transitions. Word has length 95 [2025-01-09 04:44:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:49,432 INFO L471 AbstractCegarLoop]: Abstraction has 452711 states and 638361 transitions. [2025-01-09 04:44:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:44:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 452711 states and 638361 transitions. [2025-01-09 04:44:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:49,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:49,448 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:44:49,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:44:49,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:49,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1507847386, now seen corresponding path program 1 times [2025-01-09 04:44:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51478627] [2025-01-09 04:44:49,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:49,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:49,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:49,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:44:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51478627] [2025-01-09 04:44:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51478627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771451022] [2025-01-09 04:44:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:49,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:49,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:49,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:49,649 INFO L87 Difference]: Start difference. First operand 452711 states and 638361 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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:44:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:53,235 INFO L93 Difference]: Finished difference Result 1319788 states and 1877659 transitions. [2025-01-09 04:44:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 95 [2025-01-09 04:44:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:55,637 INFO L225 Difference]: With dead ends: 1319788 [2025-01-09 04:44:55,637 INFO L226 Difference]: Without dead ends: 1105010 [2025-01-09 04:44:55,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:55,767 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1233 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:55,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1959 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105010 states.