./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+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:44:20,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:44:20,643 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:20,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:44:20,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:44:20,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:44:20,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:44:20,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:44:20,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:44:20,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:44:20,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:44:20,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:44:20,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:44:20,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:20,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:20,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:20,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:44:20,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:44:20,668 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 -> ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd [2025-01-09 04:44:20,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:44:20,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:44:20,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:44:20,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:44:20,926 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:44:20,927 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+nlh-reducer.c [2025-01-09 04:44:22,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce9835fdd/e7f29da70cc9474ab7691b262407d171/FLAG09454b23d [2025-01-09 04:44:22,382 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:44:22,383 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+nlh-reducer.c [2025-01-09 04:44:22,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce9835fdd/e7f29da70cc9474ab7691b262407d171/FLAG09454b23d [2025-01-09 04:44:22,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce9835fdd/e7f29da70cc9474ab7691b262407d171 [2025-01-09 04:44:22,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:44:22,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:44:22,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:22,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:44:22,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:44:22,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:22" (1/1) ... [2025-01-09 04:44:22,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204e8009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22, skipping insertion in model container [2025-01-09 04:44:22,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:22" (1/1) ... [2025-01-09 04:44:22,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:44:22,622 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+nlh-reducer.c[8609,8622] [2025-01-09 04:44:22,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:22,673 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:44:22,735 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+nlh-reducer.c[8609,8622] [2025-01-09 04:44:22,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:22,791 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:44:22,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22 WrapperNode [2025-01-09 04:44:22,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:22,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:22,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:44:22,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:44:22,801 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:22" (1/1) ... [2025-01-09 04:44:22,819 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:22" (1/1) ... [2025-01-09 04:44:22,855 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 881 [2025-01-09 04:44:22,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:22,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:44:22,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:44:22,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:44:22,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22" (1/1) ... [2025-01-09 04:44:22,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22" (1/1) ... [2025-01-09 04:44:22,870 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:22" (1/1) ... [2025-01-09 04:44:22,889 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:22,889 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:22" (1/1) ... [2025-01-09 04:44:22,890 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:22" (1/1) ... [2025-01-09 04:44:22,898 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:22" (1/1) ... [2025-01-09 04:44:22,899 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:22" (1/1) ... [2025-01-09 04:44:22,904 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:22" (1/1) ... [2025-01-09 04:44:22,906 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:22" (1/1) ... [2025-01-09 04:44:22,909 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:22" (1/1) ... [2025-01-09 04:44:22,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:44:22,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:44:22,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:44:22,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:44:22,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22" (1/1) ... [2025-01-09 04:44:22,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:22,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:22,946 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:22,948 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:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:44:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:44:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:44:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:44:23,062 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:44:23,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:44:23,807 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-01-09 04:44:23,808 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:44:23,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:44:23,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:44:23,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:23 BoogieIcfgContainer [2025-01-09 04:44:23,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:44:23,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:44:23,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:44:23,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:44:23,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:22" (1/3) ... [2025-01-09 04:44:23,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c5a047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:23, skipping insertion in model container [2025-01-09 04:44:23,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:22" (2/3) ... [2025-01-09 04:44:23,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c5a047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:23, skipping insertion in model container [2025-01-09 04:44:23,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:23" (3/3) ... [2025-01-09 04:44:23,834 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:44:23,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:44:23,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 216 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:44:23,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:44:23,932 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;@2f3edb35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:44:23,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:44:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 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:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:44:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:23,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:23,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash -981857485, now seen corresponding path program 1 times [2025-01-09 04:44:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134573032] [2025-01-09 04:44:23,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:44:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:44:24,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:24,526 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:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:24,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134573032] [2025-01-09 04:44:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134573032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:24,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154839446] [2025-01-09 04:44:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:24,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:24,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:24,555 INFO L87 Difference]: Start difference. First operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:24,821 INFO L93 Difference]: Finished difference Result 868 states and 1404 transitions. [2025-01-09 04:44:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:44:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:24,835 INFO L225 Difference]: With dead ends: 868 [2025-01-09 04:44:24,835 INFO L226 Difference]: Without dead ends: 748 [2025-01-09 04:44:24,838 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:24,840 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2252 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:24,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 2341 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-01-09 04:44:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 329. [2025-01-09 04:44:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 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,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2025-01-09 04:44:24,882 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 81 [2025-01-09 04:44:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:24,883 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2025-01-09 04:44:24,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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,884 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2025-01-09 04:44:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:44:24,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:24,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:44:24,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -651776507, now seen corresponding path program 1 times [2025-01-09 04:44:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946767410] [2025-01-09 04:44:24,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:44:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:44:24,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:24,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:25,223 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:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946767410] [2025-01-09 04:44:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946767410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240581582] [2025-01-09 04:44:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:25,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:25,227 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:25,474 INFO L93 Difference]: Finished difference Result 1425 states and 2199 transitions. [2025-01-09 04:44:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:25,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-09 04:44:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:25,483 INFO L225 Difference]: With dead ends: 1425 [2025-01-09 04:44:25,483 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 04:44:25,485 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:25,486 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1056 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:25,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1941 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 04:44:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1169. [2025-01-09 04:44:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 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:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1797 transitions. [2025-01-09 04:44:25,545 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1797 transitions. Word has length 82 [2025-01-09 04:44:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1797 transitions. [2025-01-09 04:44:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1797 transitions. [2025-01-09 04:44:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:25,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:25,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:25,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:44:25,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:25,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 994859382, now seen corresponding path program 1 times [2025-01-09 04:44:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853114999] [2025-01-09 04:44:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:25,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:25,717 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:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853114999] [2025-01-09 04:44:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853114999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:25,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:25,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667856310] [2025-01-09 04:44:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:25,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:25,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:25,720 INFO L87 Difference]: Start difference. First operand 1169 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:25,994 INFO L93 Difference]: Finished difference Result 3226 states and 5017 transitions. [2025-01-09 04:44:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:44:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:26,002 INFO L225 Difference]: With dead ends: 3226 [2025-01-09 04:44:26,003 INFO L226 Difference]: Without dead ends: 2100 [2025-01-09 04:44:26,007 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:26,007 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 1231 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:26,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 290 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-01-09 04:44:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2025-01-09 04:44:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 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:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3246 transitions. [2025-01-09 04:44:26,056 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3246 transitions. Word has length 83 [2025-01-09 04:44:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3246 transitions. [2025-01-09 04:44:26,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3246 transitions. [2025-01-09 04:44:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:26,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:26,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:44:26,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1568078791, now seen corresponding path program 1 times [2025-01-09 04:44:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761700866] [2025-01-09 04:44:26,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:26,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:26,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:26,223 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:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761700866] [2025-01-09 04:44:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761700866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213362252] [2025-01-09 04:44:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:26,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:26,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:26,224 INFO L87 Difference]: Start difference. First operand 2098 states and 3246 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:26,513 INFO L93 Difference]: Finished difference Result 5896 states and 9184 transitions. [2025-01-09 04:44:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:44:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:26,524 INFO L225 Difference]: With dead ends: 5896 [2025-01-09 04:44:26,525 INFO L226 Difference]: Without dead ends: 3857 [2025-01-09 04:44:26,527 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:26,527 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1191 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:26,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 294 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2025-01-09 04:44:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3855. [2025-01-09 04:44:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 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:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 5970 transitions. [2025-01-09 04:44:26,589 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 5970 transitions. Word has length 83 [2025-01-09 04:44:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 3855 states and 5970 transitions. [2025-01-09 04:44:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 5970 transitions. [2025-01-09 04:44:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:26,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:26,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:26,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:44:26,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2053901352, now seen corresponding path program 1 times [2025-01-09 04:44:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469810900] [2025-01-09 04:44:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:26,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:26,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:26,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:26,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:26,723 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:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:26,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469810900] [2025-01-09 04:44:26,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469810900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:26,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:26,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:26,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909707668] [2025-01-09 04:44:26,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:26,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:26,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:26,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:26,725 INFO L87 Difference]: Start difference. First operand 3855 states and 5970 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:26,991 INFO L93 Difference]: Finished difference Result 10980 states and 17065 transitions. [2025-01-09 04:44:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:44:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:27,013 INFO L225 Difference]: With dead ends: 10980 [2025-01-09 04:44:27,014 INFO L226 Difference]: Without dead ends: 7207 [2025-01-09 04:44:27,019 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:27,020 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1153 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:27,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 296 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2025-01-09 04:44:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 7205. [2025-01-09 04:44:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7205 states, 7204 states have (on average 1.5452526374236535) internal successors, (11132), 7204 states have internal predecessors, (11132), 0 states have call successors, (0), 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,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 11132 transitions. [2025-01-09 04:44:27,162 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 11132 transitions. Word has length 83 [2025-01-09 04:44:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:27,162 INFO L471 AbstractCegarLoop]: Abstraction has 7205 states and 11132 transitions. [2025-01-09 04:44:27,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 11132 transitions. [2025-01-09 04:44:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:27,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:27,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:44:27,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1112064425, now seen corresponding path program 1 times [2025-01-09 04:44:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400962404] [2025-01-09 04:44:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:27,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:27,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:27,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:27,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:27,299 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:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:27,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400962404] [2025-01-09 04:44:27,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400962404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:27,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:27,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485453485] [2025-01-09 04:44:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:27,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:27,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:27,303 INFO L87 Difference]: Start difference. First operand 7205 states and 11132 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:27,566 INFO L93 Difference]: Finished difference Result 20743 states and 32107 transitions. [2025-01-09 04:44:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:44:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:27,614 INFO L225 Difference]: With dead ends: 20743 [2025-01-09 04:44:27,614 INFO L226 Difference]: Without dead ends: 13650 [2025-01-09 04:44:27,627 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:27,629 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1115 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:27,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 298 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2025-01-09 04:44:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 13648. [2025-01-09 04:44:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13648 states, 13647 states have (on average 1.5395324979849052) internal successors, (21010), 13647 states have internal predecessors, (21010), 0 states have call successors, (0), 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,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13648 states to 13648 states and 21010 transitions. [2025-01-09 04:44:27,932 INFO L78 Accepts]: Start accepts. Automaton has 13648 states and 21010 transitions. Word has length 83 [2025-01-09 04:44:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 13648 states and 21010 transitions. [2025-01-09 04:44:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13648 states and 21010 transitions. [2025-01-09 04:44:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:27,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:27,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:27,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:44:27,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 340452666, now seen corresponding path program 1 times [2025-01-09 04:44:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081619917] [2025-01-09 04:44:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:28,066 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:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081619917] [2025-01-09 04:44:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081619917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736978670] [2025-01-09 04:44:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:28,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:28,068 INFO L87 Difference]: Start difference. First operand 13648 states and 21010 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:28,326 INFO L93 Difference]: Finished difference Result 39952 states and 61618 transitions. [2025-01-09 04:44:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:44:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:28,374 INFO L225 Difference]: With dead ends: 39952 [2025-01-09 04:44:28,375 INFO L226 Difference]: Without dead ends: 26450 [2025-01-09 04:44:28,395 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:28,397 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1101 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:28,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 307 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26450 states. [2025-01-09 04:44:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26450 to 26448. [2025-01-09 04:44:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26448 states, 26447 states have (on average 1.535939804136575) internal successors, (40621), 26447 states have internal predecessors, (40621), 0 states have call successors, (0), 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,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26448 states to 26448 states and 40621 transitions. [2025-01-09 04:44:28,918 INFO L78 Accepts]: Start accepts. Automaton has 26448 states and 40621 transitions. Word has length 83 [2025-01-09 04:44:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:28,918 INFO L471 AbstractCegarLoop]: Abstraction has 26448 states and 40621 transitions. [2025-01-09 04:44:28,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26448 states and 40621 transitions. [2025-01-09 04:44:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:44:28,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:28,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:28,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:44:28,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:28,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:28,928 INFO L85 PathProgramCache]: Analyzing trace with hash 31378129, now seen corresponding path program 1 times [2025-01-09 04:44:28,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:28,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952213893] [2025-01-09 04:44:28,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:28,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:44:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:44:28,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:29,162 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:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952213893] [2025-01-09 04:44:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952213893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:29,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:44:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978600982] [2025-01-09 04:44:29,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:29,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:29,164 INFO L87 Difference]: Start difference. First operand 26448 states and 40621 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:29,276 INFO L93 Difference]: Finished difference Result 27090 states and 41582 transitions. [2025-01-09 04:44:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:44:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:29,322 INFO L225 Difference]: With dead ends: 27090 [2025-01-09 04:44:29,322 INFO L226 Difference]: Without dead ends: 27088 [2025-01-09 04:44:29,333 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:29,334 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:29,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1162 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27088 states. [2025-01-09 04:44:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27088 to 27088. [2025-01-09 04:44:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27088 states, 27087 states have (on average 1.523276848672795) internal successors, (41261), 27087 states have internal predecessors, (41261), 0 states have call successors, (0), 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:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27088 states to 27088 states and 41261 transitions. [2025-01-09 04:44:29,743 INFO L78 Accepts]: Start accepts. Automaton has 27088 states and 41261 transitions. Word has length 84 [2025-01-09 04:44:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:29,743 INFO L471 AbstractCegarLoop]: Abstraction has 27088 states and 41261 transitions. [2025-01-09 04:44:29,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27088 states and 41261 transitions. [2025-01-09 04:44:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:44:29,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:29,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:29,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:44:29,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1251175856, now seen corresponding path program 1 times [2025-01-09 04:44:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46057740] [2025-01-09 04:44:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:29,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:44:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:44:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:29,923 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:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:29,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46057740] [2025-01-09 04:44:29,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46057740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424871939] [2025-01-09 04:44:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:29,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:44:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:29,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:44:29,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:44:29,926 INFO L87 Difference]: Start difference. First operand 27088 states and 41261 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:30,158 INFO L93 Difference]: Finished difference Result 76308 states and 115935 transitions. [2025-01-09 04:44:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:44:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:44:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:30,261 INFO L225 Difference]: With dead ends: 76308 [2025-01-09 04:44:30,261 INFO L226 Difference]: Without dead ends: 50066 [2025-01-09 04:44:30,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:44:30,296 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 204 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:30,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 820 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50066 states. [2025-01-09 04:44:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50066 to 50064. [2025-01-09 04:44:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50064 states, 50063 states have (on average 1.5100373529353015) internal successors, (75597), 50063 states have internal predecessors, (75597), 0 states have call successors, (0), 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,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50064 states to 50064 states and 75597 transitions. [2025-01-09 04:44:31,055 INFO L78 Accepts]: Start accepts. Automaton has 50064 states and 75597 transitions. Word has length 85 [2025-01-09 04:44:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:31,055 INFO L471 AbstractCegarLoop]: Abstraction has 50064 states and 75597 transitions. [2025-01-09 04:44:31,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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,056 INFO L276 IsEmpty]: Start isEmpty. Operand 50064 states and 75597 transitions. [2025-01-09 04:44:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:31,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:31,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:31,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:44:31,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash -678332428, now seen corresponding path program 1 times [2025-01-09 04:44:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249783554] [2025-01-09 04:44:31,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:31,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:31,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:31,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:31,115 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:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249783554] [2025-01-09 04:44:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249783554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:31,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:31,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725777348] [2025-01-09 04:44:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:31,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:31,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:31,116 INFO L87 Difference]: Start difference. First operand 50064 states and 75597 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:31,565 INFO L93 Difference]: Finished difference Result 108097 states and 163084 transitions. [2025-01-09 04:44:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:31,705 INFO L225 Difference]: With dead ends: 108097 [2025-01-09 04:44:31,705 INFO L226 Difference]: Without dead ends: 66063 [2025-01-09 04:44:31,745 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:31,746 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 203 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:31,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 565 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66063 states. [2025-01-09 04:44:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66063 to 65588. [2025-01-09 04:44:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65588 states, 65587 states have (on average 1.49121014835257) internal successors, (97804), 65587 states have internal predecessors, (97804), 0 states have call successors, (0), 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:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65588 states to 65588 states and 97804 transitions. [2025-01-09 04:44:32,911 INFO L78 Accepts]: Start accepts. Automaton has 65588 states and 97804 transitions. Word has length 86 [2025-01-09 04:44:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:32,911 INFO L471 AbstractCegarLoop]: Abstraction has 65588 states and 97804 transitions. [2025-01-09 04:44:32,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 65588 states and 97804 transitions. [2025-01-09 04:44:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:32,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:32,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:44:32,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 823665781, now seen corresponding path program 1 times [2025-01-09 04:44:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621574272] [2025-01-09 04:44:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:32,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:32,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:32,981 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:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621574272] [2025-01-09 04:44:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621574272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019338911] [2025-01-09 04:44:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:32,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:32,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:32,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:32,983 INFO L87 Difference]: Start difference. First operand 65588 states and 97804 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:33,298 INFO L93 Difference]: Finished difference Result 125255 states and 186423 transitions. [2025-01-09 04:44:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:33,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:33,410 INFO L225 Difference]: With dead ends: 125255 [2025-01-09 04:44:33,410 INFO L226 Difference]: Without dead ends: 79725 [2025-01-09 04:44:33,462 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:33,463 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 191 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:33,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 563 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79725 states. [2025-01-09 04:44:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79725 to 79128. [2025-01-09 04:44:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79128 states, 79127 states have (on average 1.4686769370758401) internal successors, (116212), 79127 states have internal predecessors, (116212), 0 states have call successors, (0), 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,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79128 states to 79128 states and 116212 transitions. [2025-01-09 04:44:34,477 INFO L78 Accepts]: Start accepts. Automaton has 79128 states and 116212 transitions. Word has length 86 [2025-01-09 04:44:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:34,477 INFO L471 AbstractCegarLoop]: Abstraction has 79128 states and 116212 transitions. [2025-01-09 04:44:34,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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,477 INFO L276 IsEmpty]: Start isEmpty. Operand 79128 states and 116212 transitions. [2025-01-09 04:44:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:34,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:34,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:34,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:44:34,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:34,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1582386452, now seen corresponding path program 1 times [2025-01-09 04:44:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275083105] [2025-01-09 04:44:34,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:34,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:34,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:34,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:34,547 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:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275083105] [2025-01-09 04:44:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275083105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521119364] [2025-01-09 04:44:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:34,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:34,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:34,548 INFO L87 Difference]: Start difference. First operand 79128 states and 116212 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:35,273 INFO L93 Difference]: Finished difference Result 134141 states and 196459 transitions. [2025-01-09 04:44:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:35,483 INFO L225 Difference]: With dead ends: 134141 [2025-01-09 04:44:35,484 INFO L226 Difference]: Without dead ends: 90451 [2025-01-09 04:44:35,559 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:35,564 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 179 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:35,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 561 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90451 states. [2025-01-09 04:44:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90451 to 89655. [2025-01-09 04:44:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89655 states, 89654 states have (on average 1.4431481027059585) internal successors, (129384), 89654 states have internal predecessors, (129384), 0 states have call successors, (0), 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:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89655 states to 89655 states and 129384 transitions. [2025-01-09 04:44:36,997 INFO L78 Accepts]: Start accepts. Automaton has 89655 states and 129384 transitions. Word has length 86 [2025-01-09 04:44:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 89655 states and 129384 transitions. [2025-01-09 04:44:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 89655 states and 129384 transitions. [2025-01-09 04:44:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:37,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:37,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:37,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:44:37,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:37,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 735785, now seen corresponding path program 1 times [2025-01-09 04:44:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:37,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56817353] [2025-01-09 04:44:37,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:37,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:37,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:37,088 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:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56817353] [2025-01-09 04:44:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56817353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319614562] [2025-01-09 04:44:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:37,090 INFO L87 Difference]: Start difference. First operand 89655 states and 129384 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:37,781 INFO L93 Difference]: Finished difference Result 124081 states and 178328 transitions. [2025-01-09 04:44:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:38,084 INFO L225 Difference]: With dead ends: 124081 [2025-01-09 04:44:38,084 INFO L226 Difference]: Without dead ends: 92183 [2025-01-09 04:44:38,115 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:38,117 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 171 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:38,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 562 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92183 states. [2025-01-09 04:44:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92183 to 82685. [2025-01-09 04:44:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82685 states, 82684 states have (on average 1.4202264041410673) internal successors, (117430), 82684 states have internal predecessors, (117430), 0 states have call successors, (0), 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,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82685 states to 82685 states and 117430 transitions. [2025-01-09 04:44:39,121 INFO L78 Accepts]: Start accepts. Automaton has 82685 states and 117430 transitions. Word has length 86 [2025-01-09 04:44:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:39,121 INFO L471 AbstractCegarLoop]: Abstraction has 82685 states and 117430 transitions. [2025-01-09 04:44:39,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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,121 INFO L276 IsEmpty]: Start isEmpty. Operand 82685 states and 117430 transitions. [2025-01-09 04:44:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:39,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:39,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:44:39,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -872252011, now seen corresponding path program 1 times [2025-01-09 04:44:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371112246] [2025-01-09 04:44:39,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:39,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:39,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:39,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:39,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:39,273 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:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371112246] [2025-01-09 04:44:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371112246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:39,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:39,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:39,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833718823] [2025-01-09 04:44:39,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:39,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:39,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:39,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:39,274 INFO L87 Difference]: Start difference. First operand 82685 states and 117430 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:40,178 INFO L93 Difference]: Finished difference Result 192545 states and 275328 transitions. [2025-01-09 04:44:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:40,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:40,387 INFO L225 Difference]: With dead ends: 192545 [2025-01-09 04:44:40,388 INFO L226 Difference]: Without dead ends: 160857 [2025-01-09 04:44:40,408 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:40,408 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1650 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:40,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 2267 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160857 states. [2025-01-09 04:44:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160857 to 108033. [2025-01-09 04:44:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108033 states, 108032 states have (on average 1.420236596563981) internal successors, (153431), 108032 states have internal predecessors, (153431), 0 states have call successors, (0), 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:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108033 states to 108033 states and 153431 transitions. [2025-01-09 04:44:41,856 INFO L78 Accepts]: Start accepts. Automaton has 108033 states and 153431 transitions. Word has length 86 [2025-01-09 04:44:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 108033 states and 153431 transitions. [2025-01-09 04:44:41,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 108033 states and 153431 transitions. [2025-01-09 04:44:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:41,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:41,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:41,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:44:41,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 853569556, now seen corresponding path program 1 times [2025-01-09 04:44:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917459560] [2025-01-09 04:44:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:41,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:41,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:41,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:41,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:41,975 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:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917459560] [2025-01-09 04:44:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917459560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122942656] [2025-01-09 04:44:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:41,977 INFO L87 Difference]: Start difference. First operand 108033 states and 153431 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:42,994 INFO L93 Difference]: Finished difference Result 219493 states and 313628 transitions. [2025-01-09 04:44:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:43,270 INFO L225 Difference]: With dead ends: 219493 [2025-01-09 04:44:43,271 INFO L226 Difference]: Without dead ends: 186023 [2025-01-09 04:44:43,334 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:43,334 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1639 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:43,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2056 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186023 states. [2025-01-09 04:44:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186023 to 139666. [2025-01-09 04:44:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139666 states, 139665 states have (on average 1.4203057315719758) internal successors, (198367), 139665 states have internal predecessors, (198367), 0 states have call successors, (0), 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:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139666 states to 139666 states and 198367 transitions. [2025-01-09 04:44:45,520 INFO L78 Accepts]: Start accepts. Automaton has 139666 states and 198367 transitions. Word has length 86 [2025-01-09 04:44:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:45,521 INFO L471 AbstractCegarLoop]: Abstraction has 139666 states and 198367 transitions. [2025-01-09 04:44:45,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 139666 states and 198367 transitions. [2025-01-09 04:44:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:45,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:45,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:44:45,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 687721653, now seen corresponding path program 1 times [2025-01-09 04:44:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862865905] [2025-01-09 04:44:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:45,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:45,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:45,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:45,634 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:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862865905] [2025-01-09 04:44:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862865905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879616597] [2025-01-09 04:44:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:45,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:45,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:45,635 INFO L87 Difference]: Start difference. First operand 139666 states and 198367 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:46,323 INFO L93 Difference]: Finished difference Result 240051 states and 342716 transitions. [2025-01-09 04:44:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:47,023 INFO L225 Difference]: With dead ends: 240051 [2025-01-09 04:44:47,023 INFO L226 Difference]: Without dead ends: 212869 [2025-01-09 04:44:47,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:47,078 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 1745 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:47,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 1942 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212869 states. [2025-01-09 04:44:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212869 to 154994. [2025-01-09 04:44:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154994 states, 154993 states have (on average 1.421773886562619) internal successors, (220365), 154993 states have internal predecessors, (220365), 0 states have call successors, (0), 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,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154994 states to 154994 states and 220365 transitions. [2025-01-09 04:44:49,377 INFO L78 Accepts]: Start accepts. Automaton has 154994 states and 220365 transitions. Word has length 86 [2025-01-09 04:44:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:49,377 INFO L471 AbstractCegarLoop]: Abstraction has 154994 states and 220365 transitions. [2025-01-09 04:44:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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,378 INFO L276 IsEmpty]: Start isEmpty. Operand 154994 states and 220365 transitions. [2025-01-09 04:44:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:49,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:49,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:49,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:44:49,389 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:49,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1169859212, now seen corresponding path program 1 times [2025-01-09 04:44:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226978722] [2025-01-09 04:44:49,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:49,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:49,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:49,496 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:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226978722] [2025-01-09 04:44:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226978722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399411116] [2025-01-09 04:44:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:49,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:49,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:49,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:49,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:49,497 INFO L87 Difference]: Start difference. First operand 154994 states and 220365 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:50,467 INFO L93 Difference]: Finished difference Result 247983 states and 353678 transitions. [2025-01-09 04:44:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:50,836 INFO L225 Difference]: With dead ends: 247983 [2025-01-09 04:44:50,836 INFO L226 Difference]: Without dead ends: 230305 [2025-01-09 04:44:50,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:50,921 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 1858 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:50,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 2021 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230305 states. [2025-01-09 04:44:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230305 to 163902. [2025-01-09 04:44:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163902 states, 163901 states have (on average 1.4228040097375856) internal successors, (233199), 163901 states have internal predecessors, (233199), 0 states have call successors, (0), 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,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163902 states to 163902 states and 233199 transitions. [2025-01-09 04:44:53,944 INFO L78 Accepts]: Start accepts. Automaton has 163902 states and 233199 transitions. Word has length 86 [2025-01-09 04:44:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:53,945 INFO L471 AbstractCegarLoop]: Abstraction has 163902 states and 233199 transitions. [2025-01-09 04:44:53,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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,945 INFO L276 IsEmpty]: Start isEmpty. Operand 163902 states and 233199 transitions. [2025-01-09 04:44:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:53,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:53,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:44:53,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:53,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1883936087, now seen corresponding path program 1 times [2025-01-09 04:44:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:53,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880940524] [2025-01-09 04:44:53,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:53,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:54,051 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:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880940524] [2025-01-09 04:44:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880940524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:54,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102754498] [2025-01-09 04:44:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:54,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:54,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:54,052 INFO L87 Difference]: Start difference. First operand 163902 states and 233199 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:54,704 INFO L93 Difference]: Finished difference Result 245967 states and 350540 transitions. [2025-01-09 04:44:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:44:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:44:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:55,465 INFO L225 Difference]: With dead ends: 245967 [2025-01-09 04:44:55,466 INFO L226 Difference]: Without dead ends: 238081 [2025-01-09 04:44:55,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:55,529 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1676 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:55,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2278 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238081 states. [2025-01-09 04:44:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238081 to 171678. [2025-01-09 04:44:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171678 states, 171677 states have (on average 1.4228405668784985) internal successors, (244269), 171677 states have internal predecessors, (244269), 0 states have call successors, (0), 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:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171678 states to 171678 states and 244269 transitions. [2025-01-09 04:44:58,076 INFO L78 Accepts]: Start accepts. Automaton has 171678 states and 244269 transitions. Word has length 86 [2025-01-09 04:44:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 171678 states and 244269 transitions. [2025-01-09 04:44:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 171678 states and 244269 transitions. [2025-01-09 04:44:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:44:58,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:58,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:44:58,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -408892314, now seen corresponding path program 1 times [2025-01-09 04:44:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314975220] [2025-01-09 04:44:58,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:58,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:44:58,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:44:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:58,127 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:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314975220] [2025-01-09 04:44:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314975220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940871647] [2025-01-09 04:44:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:58,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:58,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:58,129 INFO L87 Difference]: Start difference. First operand 171678 states and 244269 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:59,658 INFO L93 Difference]: Finished difference Result 468838 states and 666097 transitions. [2025-01-09 04:44:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:44:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:45:00,133 INFO L225 Difference]: With dead ends: 468838 [2025-01-09 04:45:00,133 INFO L226 Difference]: Without dead ends: 304869 [2025-01-09 04:45:00,251 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:45:00,252 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:45:00,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 678 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:45:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304869 states. [2025-01-09 04:45:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304869 to 284124. [2025-01-09 04:45:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284124 states, 284123 states have (on average 1.4085096947448816) internal successors, (400190), 284123 states have internal predecessors, (400190), 0 states have call successors, (0), 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:45:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284124 states to 284124 states and 400190 transitions. [2025-01-09 04:45:04,453 INFO L78 Accepts]: Start accepts. Automaton has 284124 states and 400190 transitions. Word has length 89 [2025-01-09 04:45:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:45:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 284124 states and 400190 transitions. [2025-01-09 04:45:04,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:45:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 284124 states and 400190 transitions. [2025-01-09 04:45:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:45:04,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:45:04,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:45:04,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:45:04,475 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:45:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:45:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1749086746, now seen corresponding path program 1 times [2025-01-09 04:45:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:45:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888010835] [2025-01-09 04:45:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:45:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:45:04,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:45:04,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:45:04,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:45:04,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:45:04,571 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:45:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:45:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888010835] [2025-01-09 04:45:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888010835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:45:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:45:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:45:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989083496] [2025-01-09 04:45:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:45:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:45:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:45:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:45:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:45:04,572 INFO L87 Difference]: Start difference. First operand 284124 states and 400190 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)