./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96fefa83b30613ea39cc46bf8d68e79f92b274b671b8c94e773ac8e262712116 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:35:35,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:35:35,191 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:35:35,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:35:35,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:35:35,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:35:35,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:35:35,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:35:35,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:35:35,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:35:35,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:35:35,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:35:35,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:35:35,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:35:35,227 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:35:35,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:35:35,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:35:35,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:35:35,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:35,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:35,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:35:35,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:35:35,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:35:35,230 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 -> 96fefa83b30613ea39cc46bf8d68e79f92b274b671b8c94e773ac8e262712116 [2025-01-09 04:35:35,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:35:35,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:35:35,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:35:35,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:35:35,476 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:35:35,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:35:36,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18456b35a/c27e5d099c5247ff8a00c74e8652c08b/FLAG1e4b6771d [2025-01-09 04:35:36,937 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:35:36,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:35:36,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18456b35a/c27e5d099c5247ff8a00c74e8652c08b/FLAG1e4b6771d [2025-01-09 04:35:37,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18456b35a/c27e5d099c5247ff8a00c74e8652c08b [2025-01-09 04:35:37,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:35:37,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:35:37,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:35:37,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:35:37,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:35:37,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10595b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37, skipping insertion in model container [2025-01-09 04:35:37,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:35:37,441 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2025-01-09 04:35:37,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:35:37,483 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:35:37,538 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2025-01-09 04:35:37,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:35:37,570 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:35:37,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37 WrapperNode [2025-01-09 04:35:37,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:35:37,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:35:37,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:35:37,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:35:37,578 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:35:37" (1/1) ... [2025-01-09 04:35:37,592 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:35:37" (1/1) ... [2025-01-09 04:35:37,620 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2025-01-09 04:35:37,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:35:37,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:35:37,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:35:37,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:35:37,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,649 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:35:37,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:35:37,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:35:37,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:35:37,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:35:37,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (1/1) ... [2025-01-09 04:35:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:35:37,723 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:35:37,726 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:35:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:35:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:35:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:35:37,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:35:37,824 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:35:37,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:35:38,308 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 04:35:38,309 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:35:38,317 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:35:38,317 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:35:38,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:38 BoogieIcfgContainer [2025-01-09 04:35:38,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:35:38,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:35:38,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:35:38,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:35:38,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:35:37" (1/3) ... [2025-01-09 04:35:38,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371b3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:38, skipping insertion in model container [2025-01-09 04:35:38,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:37" (2/3) ... [2025-01-09 04:35:38,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371b3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:38, skipping insertion in model container [2025-01-09 04:35:38,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:38" (3/3) ... [2025-01-09 04:35:38,330 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-01-09 04:35:38,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:35:38,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 135 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:35:38,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:35:38,420 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;@18965438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:35:38,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:35:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:35:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:35:38,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:38,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:38,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1933157835, now seen corresponding path program 1 times [2025-01-09 04:35:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462082537] [2025-01-09 04:35:38,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:38,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:35:38,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:35:38,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:38,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:38,870 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:35:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462082537] [2025-01-09 04:35:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462082537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581103079] [2025-01-09 04:35:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:38,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:38,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:38,902 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:35:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:38,995 INFO L93 Difference]: Finished difference Result 288 states and 491 transitions. [2025-01-09 04:35:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:35:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:39,006 INFO L225 Difference]: With dead ends: 288 [2025-01-09 04:35:39,006 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 04:35:39,009 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:35:39,011 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 131 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:39,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 412 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 04:35:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-01-09 04:35:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:35:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2025-01-09 04:35:39,042 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 57 [2025-01-09 04:35:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2025-01-09 04:35:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:35:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2025-01-09 04:35:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:35:39,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:39,045 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] [2025-01-09 04:35:39,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:35:39,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:39,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1883490782, now seen corresponding path program 1 times [2025-01-09 04:35:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21247866] [2025-01-09 04:35:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:35:39,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:35:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:39,241 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:35:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:39,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21247866] [2025-01-09 04:35:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21247866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031844783] [2025-01-09 04:35:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:39,243 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:35:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:39,275 INFO L93 Difference]: Finished difference Result 475 states and 769 transitions. [2025-01-09 04:35:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-01-09 04:35:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:39,282 INFO L225 Difference]: With dead ends: 475 [2025-01-09 04:35:39,282 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 04:35:39,283 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:35:39,283 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:39,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 04:35:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-01-09 04:35:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:35:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2025-01-09 04:35:39,303 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 59 [2025-01-09 04:35:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:39,303 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2025-01-09 04:35:39,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:35:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2025-01-09 04:35:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:35:39,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:39,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:35:39,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -111872728, now seen corresponding path program 1 times [2025-01-09 04:35:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361650122] [2025-01-09 04:35:39,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:39,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:35:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:35:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:39,438 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:35:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361650122] [2025-01-09 04:35:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361650122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032730723] [2025-01-09 04:35:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:39,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:39,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:39,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:39,440 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:39,474 INFO L93 Difference]: Finished difference Result 603 states and 981 transitions. [2025-01-09 04:35:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:35:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:39,480 INFO L225 Difference]: With dead ends: 603 [2025-01-09 04:35:39,480 INFO L226 Difference]: Without dead ends: 458 [2025-01-09 04:35:39,483 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:35:39,483 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:39,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-09 04:35:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2025-01-09 04:35:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:35:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 735 transitions. [2025-01-09 04:35:39,507 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 735 transitions. Word has length 61 [2025-01-09 04:35:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:39,511 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 735 transitions. [2025-01-09 04:35:39,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 735 transitions. [2025-01-09 04:35:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:35:39,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:39,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:35:39,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1275396395, now seen corresponding path program 1 times [2025-01-09 04:35:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441824313] [2025-01-09 04:35:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:39,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:35:39,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:35:39,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:39,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:39,668 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:35:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441824313] [2025-01-09 04:35:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441824313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:39,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:39,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825510028] [2025-01-09 04:35:39,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:39,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:39,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:39,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:39,670 INFO L87 Difference]: Start difference. First operand 456 states and 735 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:39,698 INFO L93 Difference]: Finished difference Result 1172 states and 1911 transitions. [2025-01-09 04:35:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:35:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:39,701 INFO L225 Difference]: With dead ends: 1172 [2025-01-09 04:35:39,702 INFO L226 Difference]: Without dead ends: 793 [2025-01-09 04:35:39,705 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:35:39,706 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:39,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-01-09 04:35:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2025-01-09 04:35:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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:35:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1277 transitions. [2025-01-09 04:35:39,726 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1277 transitions. Word has length 61 [2025-01-09 04:35:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1277 transitions. [2025-01-09 04:35:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1277 transitions. [2025-01-09 04:35:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:35:39,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:39,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:39,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:35:39,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1280827262, now seen corresponding path program 1 times [2025-01-09 04:35:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517210785] [2025-01-09 04:35:39,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:39,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:35:39,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:35:39,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:39,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:39,893 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:35:39,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517210785] [2025-01-09 04:35:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517210785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:39,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:39,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445019841] [2025-01-09 04:35:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:39,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:39,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:39,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:39,895 INFO L87 Difference]: Start difference. First operand 791 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:40,072 INFO L93 Difference]: Finished difference Result 3568 states and 5888 transitions. [2025-01-09 04:35:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:35:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:35:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:40,083 INFO L225 Difference]: With dead ends: 3568 [2025-01-09 04:35:40,083 INFO L226 Difference]: Without dead ends: 2854 [2025-01-09 04:35:40,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:35:40,086 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 881 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:40,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1260 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-01-09 04:35:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 1432. [2025-01-09 04:35:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have 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:35:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2323 transitions. [2025-01-09 04:35:40,129 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2323 transitions. Word has length 63 [2025-01-09 04:35:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:40,129 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2323 transitions. [2025-01-09 04:35:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2323 transitions. [2025-01-09 04:35:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:35:40,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:40,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:35:40,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1113443658, now seen corresponding path program 1 times [2025-01-09 04:35:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930842991] [2025-01-09 04:35:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:40,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:35:40,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:35:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:40,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:40,252 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:35:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930842991] [2025-01-09 04:35:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930842991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:40,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:40,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:40,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813468067] [2025-01-09 04:35:40,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:40,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:40,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:40,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:40,255 INFO L87 Difference]: Start difference. First operand 1432 states and 2323 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:40,329 INFO L93 Difference]: Finished difference Result 4199 states and 6910 transitions. [2025-01-09 04:35:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:35:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:40,338 INFO L225 Difference]: With dead ends: 4199 [2025-01-09 04:35:40,338 INFO L226 Difference]: Without dead ends: 2846 [2025-01-09 04:35:40,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:40,342 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:40,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 674 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-01-09 04:35:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2127. [2025-01-09 04:35:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have 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:35:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3466 transitions. [2025-01-09 04:35:40,394 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3466 transitions. Word has length 64 [2025-01-09 04:35:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:40,395 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 3466 transitions. [2025-01-09 04:35:40,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3466 transitions. [2025-01-09 04:35:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:35:40,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:40,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:40,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:35:40,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:40,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1248232611, now seen corresponding path program 1 times [2025-01-09 04:35:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998577080] [2025-01-09 04:35:40,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:35:40,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:35:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:40,464 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:35:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998577080] [2025-01-09 04:35:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998577080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:40,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:40,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063634625] [2025-01-09 04:35:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:40,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:40,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:40,466 INFO L87 Difference]: Start difference. First operand 2127 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:40,497 INFO L93 Difference]: Finished difference Result 4121 states and 6752 transitions. [2025-01-09 04:35:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:35:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:40,507 INFO L225 Difference]: With dead ends: 4121 [2025-01-09 04:35:40,507 INFO L226 Difference]: Without dead ends: 2979 [2025-01-09 04:35:40,510 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:35:40,510 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:40,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-01-09 04:35:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2977. [2025-01-09 04:35:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have 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:35:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4838 transitions. [2025-01-09 04:35:40,572 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4838 transitions. Word has length 64 [2025-01-09 04:35:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:40,573 INFO L471 AbstractCegarLoop]: Abstraction has 2977 states and 4838 transitions. [2025-01-09 04:35:40,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4838 transitions. [2025-01-09 04:35:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:35:40,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:40,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:40,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:35:40,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:40,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash -358605347, now seen corresponding path program 1 times [2025-01-09 04:35:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071294209] [2025-01-09 04:35:40,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:35:40,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:35:40,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:40,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:40,651 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:35:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071294209] [2025-01-09 04:35:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071294209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816829724] [2025-01-09 04:35:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:40,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:40,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:40,653 INFO L87 Difference]: Start difference. First operand 2977 states and 4838 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:40,687 INFO L93 Difference]: Finished difference Result 6399 states and 10550 transitions. [2025-01-09 04:35:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:35:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:40,700 INFO L225 Difference]: With dead ends: 6399 [2025-01-09 04:35:40,701 INFO L226 Difference]: Without dead ends: 4313 [2025-01-09 04:35:40,705 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:35:40,705 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:40,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-01-09 04:35:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4311. [2025-01-09 04:35:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have 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:35:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7039 transitions. [2025-01-09 04:35:40,778 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7039 transitions. Word has length 64 [2025-01-09 04:35:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:40,779 INFO L471 AbstractCegarLoop]: Abstraction has 4311 states and 7039 transitions. [2025-01-09 04:35:40,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7039 transitions. [2025-01-09 04:35:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:35:40,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:40,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:40,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:35:40,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:40,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -214961207, now seen corresponding path program 1 times [2025-01-09 04:35:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711021137] [2025-01-09 04:35:40,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:40,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:35:40,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:35:40,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:40,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:40,884 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:35:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711021137] [2025-01-09 04:35:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711021137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:40,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129720803] [2025-01-09 04:35:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:40,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:40,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:40,886 INFO L87 Difference]: Start difference. First operand 4311 states and 7039 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:40,991 INFO L93 Difference]: Finished difference Result 13702 states and 22482 transitions. [2025-01-09 04:35:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:35:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:41,027 INFO L225 Difference]: With dead ends: 13702 [2025-01-09 04:35:41,027 INFO L226 Difference]: Without dead ends: 9473 [2025-01-09 04:35:41,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:41,041 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:41,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 681 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states. [2025-01-09 04:35:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 6863. [2025-01-09 04:35:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6863 states, 6862 states have (on average 1.6264937336053629) internal successors, (11161), 6862 states have internal predecessors, (11161), 0 states have call successors, (0), 0 states have 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:35:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6863 states to 6863 states and 11161 transitions. [2025-01-09 04:35:41,210 INFO L78 Accepts]: Start accepts. Automaton has 6863 states and 11161 transitions. Word has length 65 [2025-01-09 04:35:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:41,210 INFO L471 AbstractCegarLoop]: Abstraction has 6863 states and 11161 transitions. [2025-01-09 04:35:41,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6863 states and 11161 transitions. [2025-01-09 04:35:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:35:41,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:41,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:41,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:35:41,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1872749021, now seen corresponding path program 1 times [2025-01-09 04:35:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123061416] [2025-01-09 04:35:41,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:41,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:35:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:35:41,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:35:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123061416] [2025-01-09 04:35:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123061416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:41,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:41,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362124922] [2025-01-09 04:35:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:41,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:41,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:41,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:41,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:41,295 INFO L87 Difference]: Start difference. First operand 6863 states and 11161 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:41,403 INFO L93 Difference]: Finished difference Result 21434 states and 34994 transitions. [2025-01-09 04:35:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:35:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:41,437 INFO L225 Difference]: With dead ends: 21434 [2025-01-09 04:35:41,437 INFO L226 Difference]: Without dead ends: 14653 [2025-01-09 04:35:41,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:41,449 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 375 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:41,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 663 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14653 states. [2025-01-09 04:35:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14653 to 10715. [2025-01-09 04:35:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.6190965092402465) internal successors, (17347), 10714 states have internal predecessors, (17347), 0 states have call successors, (0), 0 states have 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:35:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17347 transitions. [2025-01-09 04:35:41,677 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17347 transitions. Word has length 66 [2025-01-09 04:35:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:41,680 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17347 transitions. [2025-01-09 04:35:41,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17347 transitions. [2025-01-09 04:35:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:35:41,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:41,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:41,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:35:41,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:41,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1396799506, now seen corresponding path program 1 times [2025-01-09 04:35:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:41,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734807845] [2025-01-09 04:35:41,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:35:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:35:41,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:41,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:41,877 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:35:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734807845] [2025-01-09 04:35:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734807845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145436730] [2025-01-09 04:35:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:41,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:41,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:41,880 INFO L87 Difference]: Start difference. First operand 10715 states and 17347 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:42,001 INFO L93 Difference]: Finished difference Result 21350 states and 34583 transitions. [2025-01-09 04:35:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:35:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:42,019 INFO L225 Difference]: With dead ends: 21350 [2025-01-09 04:35:42,019 INFO L226 Difference]: Without dead ends: 10717 [2025-01-09 04:35:42,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:42,034 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 313 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:42,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 552 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2025-01-09 04:35:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 10715. [2025-01-09 04:35:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.607429531454172) internal successors, (17222), 10714 states have internal predecessors, (17222), 0 states have call successors, (0), 0 states have 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:35:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17222 transitions. [2025-01-09 04:35:42,225 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17222 transitions. Word has length 68 [2025-01-09 04:35:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:42,225 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17222 transitions. [2025-01-09 04:35:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17222 transitions. [2025-01-09 04:35:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:35:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:42,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:35:42,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -164512453, now seen corresponding path program 1 times [2025-01-09 04:35:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817342739] [2025-01-09 04:35:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:42,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:35:42,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:35:42,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:42,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:42,443 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:35:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817342739] [2025-01-09 04:35:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817342739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167642806] [2025-01-09 04:35:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:42,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:42,446 INFO L87 Difference]: Start difference. First operand 10715 states and 17222 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:42,576 INFO L93 Difference]: Finished difference Result 30660 states and 49437 transitions. [2025-01-09 04:35:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:42,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:35:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:42,615 INFO L225 Difference]: With dead ends: 30660 [2025-01-09 04:35:42,616 INFO L226 Difference]: Without dead ends: 20027 [2025-01-09 04:35:42,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:42,632 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 205 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 559 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20027 states. [2025-01-09 04:35:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20027 to 20025. [2025-01-09 04:35:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20025 states, 20024 states have (on average 1.5949360767079506) internal successors, (31937), 20024 states have internal predecessors, (31937), 0 states have call successors, (0), 0 states have 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:35:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20025 states to 20025 states and 31937 transitions. [2025-01-09 04:35:42,958 INFO L78 Accepts]: Start accepts. Automaton has 20025 states and 31937 transitions. Word has length 71 [2025-01-09 04:35:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 20025 states and 31937 transitions. [2025-01-09 04:35:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20025 states and 31937 transitions. [2025-01-09 04:35:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:35:42,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:42,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:42,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:35:42,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -806828053, now seen corresponding path program 1 times [2025-01-09 04:35:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038979489] [2025-01-09 04:35:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:42,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:35:43,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:35:43,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:43,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:43,308 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:35:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038979489] [2025-01-09 04:35:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038979489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94890860] [2025-01-09 04:35:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:43,309 INFO L87 Difference]: Start difference. First operand 20025 states and 31937 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:43,368 INFO L93 Difference]: Finished difference Result 20751 states and 33024 transitions. [2025-01-09 04:35:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:35:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:43,403 INFO L225 Difference]: With dead ends: 20751 [2025-01-09 04:35:43,403 INFO L226 Difference]: Without dead ends: 20749 [2025-01-09 04:35:43,412 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:35:43,413 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:43,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 787 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2025-01-09 04:35:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 20749. [2025-01-09 04:35:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20749 states, 20748 states have (on average 1.573742047426258) internal successors, (32652), 20748 states have internal predecessors, (32652), 0 states have call successors, (0), 0 states have 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:35:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 32652 transitions. [2025-01-09 04:35:43,665 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 32652 transitions. Word has length 72 [2025-01-09 04:35:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 20749 states and 32652 transitions. [2025-01-09 04:35:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 32652 transitions. [2025-01-09 04:35:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:35:43,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:43,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:43,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:35:43,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 25494517, now seen corresponding path program 1 times [2025-01-09 04:35:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734383603] [2025-01-09 04:35:43,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:43,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:35:43,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:35:43,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:35:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734383603] [2025-01-09 04:35:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734383603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908194510] [2025-01-09 04:35:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:43,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:43,784 INFO L87 Difference]: Start difference. First operand 20749 states and 32652 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:35:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:44,104 INFO L93 Difference]: Finished difference Result 50557 states and 79854 transitions. [2025-01-09 04:35:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:44,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 93 [2025-01-09 04:35:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:44,161 INFO L225 Difference]: With dead ends: 50557 [2025-01-09 04:35:44,161 INFO L226 Difference]: Without dead ends: 40765 [2025-01-09 04:35:44,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:35:44,171 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 479 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:44,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 937 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2025-01-09 04:35:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 31835. [2025-01-09 04:35:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31835 states, 31834 states have (on average 1.572532512408117) internal successors, (50060), 31834 states have internal predecessors, (50060), 0 states have call successors, (0), 0 states have 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:35:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31835 states to 31835 states and 50060 transitions. [2025-01-09 04:35:44,635 INFO L78 Accepts]: Start accepts. Automaton has 31835 states and 50060 transitions. Word has length 93 [2025-01-09 04:35:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 31835 states and 50060 transitions. [2025-01-09 04:35:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:35:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31835 states and 50060 transitions. [2025-01-09 04:35:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:35:44,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:44,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:44,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:35:44,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1396393528, now seen corresponding path program 1 times [2025-01-09 04:35:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479349359] [2025-01-09 04:35:44,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:44,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:35:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:35:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:35:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479349359] [2025-01-09 04:35:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479349359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80335875] [2025-01-09 04:35:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:44,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:44,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:44,772 INFO L87 Difference]: Start difference. First operand 31835 states and 50060 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:35:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:45,168 INFO L93 Difference]: Finished difference Result 54449 states and 86018 transitions. [2025-01-09 04:35:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 93 [2025-01-09 04:35:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:45,229 INFO L225 Difference]: With dead ends: 54449 [2025-01-09 04:35:45,229 INFO L226 Difference]: Without dead ends: 44657 [2025-01-09 04:35:45,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:35:45,240 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 478 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:45,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 873 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2025-01-09 04:35:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 43067. [2025-01-09 04:35:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43067 states, 43066 states have (on average 1.573445409371662) internal successors, (67762), 43066 states have internal predecessors, (67762), 0 states have call successors, (0), 0 states have 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:35:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43067 states to 43067 states and 67762 transitions. [2025-01-09 04:35:45,679 INFO L78 Accepts]: Start accepts. Automaton has 43067 states and 67762 transitions. Word has length 93 [2025-01-09 04:35:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:45,679 INFO L471 AbstractCegarLoop]: Abstraction has 43067 states and 67762 transitions. [2025-01-09 04:35:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have 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:35:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43067 states and 67762 transitions. [2025-01-09 04:35:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:35:45,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:45,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:35:45,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:45,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash -903182280, now seen corresponding path program 1 times [2025-01-09 04:35:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:45,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085806974] [2025-01-09 04:35:45,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:45,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:35:45,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:35:45,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:45,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:35:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085806974] [2025-01-09 04:35:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085806974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376604759] [2025-01-09 04:35:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:45,741 INFO L87 Difference]: Start difference. First operand 43067 states and 67762 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:35:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:46,066 INFO L93 Difference]: Finished difference Result 89605 states and 141689 transitions. [2025-01-09 04:35:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:46,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 93 [2025-01-09 04:35:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:46,202 INFO L225 Difference]: With dead ends: 89605 [2025-01-09 04:35:46,202 INFO L226 Difference]: Without dead ends: 79583 [2025-01-09 04:35:46,231 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:35:46,233 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:46,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 370 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79583 states. [2025-01-09 04:35:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79583 to 79466. [2025-01-09 04:35:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79466 states, 79465 states have (on average 1.5773233499024728) internal successors, (125342), 79465 states have internal predecessors, (125342), 0 states have call successors, (0), 0 states have 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:35:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79466 states to 79466 states and 125342 transitions. [2025-01-09 04:35:47,128 INFO L78 Accepts]: Start accepts. Automaton has 79466 states and 125342 transitions. Word has length 93 [2025-01-09 04:35:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:47,129 INFO L471 AbstractCegarLoop]: Abstraction has 79466 states and 125342 transitions. [2025-01-09 04:35:47,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:35:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 79466 states and 125342 transitions. [2025-01-09 04:35:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:35:47,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:47,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:47,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:35:47,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:47,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1205465200, now seen corresponding path program 1 times [2025-01-09 04:35:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444005026] [2025-01-09 04:35:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:47,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:35:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:35:47,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:35:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444005026] [2025-01-09 04:35:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444005026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11398130] [2025-01-09 04:35:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:47,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:47,240 INFO L87 Difference]: Start difference. First operand 79466 states and 125342 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:48,007 INFO L93 Difference]: Finished difference Result 152410 states and 240883 transitions. [2025-01-09 04:35:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:35:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:48,141 INFO L225 Difference]: With dead ends: 152410 [2025-01-09 04:35:48,142 INFO L226 Difference]: Without dead ends: 73026 [2025-01-09 04:35:48,176 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:35:48,176 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:48,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 433 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73026 states. [2025-01-09 04:35:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73026 to 73020. [2025-01-09 04:35:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73020 states, 73019 states have (on average 1.5737410810884838) internal successors, (114913), 73019 states have internal predecessors, (114913), 0 states have call successors, (0), 0 states have 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:35:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73020 states to 73020 states and 114913 transitions. [2025-01-09 04:35:49,225 INFO L78 Accepts]: Start accepts. Automaton has 73020 states and 114913 transitions. Word has length 94 [2025-01-09 04:35:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:49,226 INFO L471 AbstractCegarLoop]: Abstraction has 73020 states and 114913 transitions. [2025-01-09 04:35:49,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 73020 states and 114913 transitions. [2025-01-09 04:35:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:35:49,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:49,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:49,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:35:49,228 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1028591990, now seen corresponding path program 1 times [2025-01-09 04:35:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:49,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183626977] [2025-01-09 04:35:49,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:35:49,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:35:49,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:49,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:35:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183626977] [2025-01-09 04:35:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183626977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:49,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534669357] [2025-01-09 04:35:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:49,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:49,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:49,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:49,284 INFO L87 Difference]: Start difference. First operand 73020 states and 114913 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:49,969 INFO L93 Difference]: Finished difference Result 214865 states and 338088 transitions. [2025-01-09 04:35:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:35:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:50,196 INFO L225 Difference]: With dead ends: 214865 [2025-01-09 04:35:50,196 INFO L226 Difference]: Without dead ends: 141929 [2025-01-09 04:35:50,250 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:35:50,250 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:50,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141929 states. [2025-01-09 04:35:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141929 to 141927. [2025-01-09 04:35:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141927 states, 141926 states have (on average 1.562180291137635) internal successors, (221714), 141926 states have internal predecessors, (221714), 0 states have call successors, (0), 0 states have 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:35:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141927 states to 141927 states and 221714 transitions. [2025-01-09 04:35:52,153 INFO L78 Accepts]: Start accepts. Automaton has 141927 states and 221714 transitions. Word has length 94 [2025-01-09 04:35:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:52,153 INFO L471 AbstractCegarLoop]: Abstraction has 141927 states and 221714 transitions. [2025-01-09 04:35:52,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:35:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 141927 states and 221714 transitions. [2025-01-09 04:35:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:35:52,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:52,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:52,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:35:52,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:52,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -209592631, now seen corresponding path program 1 times [2025-01-09 04:35:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:52,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767190513] [2025-01-09 04:35:52,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:35:52,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:35:52,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:52,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:35:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767190513] [2025-01-09 04:35:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767190513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:52,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:52,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:52,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659501529] [2025-01-09 04:35:52,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:52,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:52,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:52,377 INFO L87 Difference]: Start difference. First operand 141927 states and 221714 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:35:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:53,562 INFO L93 Difference]: Finished difference Result 335467 states and 527319 transitions. [2025-01-09 04:35:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:35:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:54,329 INFO L225 Difference]: With dead ends: 335467 [2025-01-09 04:35:54,330 INFO L226 Difference]: Without dead ends: 255277 [2025-01-09 04:35:54,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:54,403 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 405 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:54,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 538 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255277 states. [2025-01-09 04:35:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255277 to 220587. [2025-01-09 04:35:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220587 states, 220586 states have (on average 1.565820133644021) internal successors, (345398), 220586 states have internal predecessors, (345398), 0 states have call successors, (0), 0 states have 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:35:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220587 states to 220587 states and 345398 transitions. [2025-01-09 04:35:57,436 INFO L78 Accepts]: Start accepts. Automaton has 220587 states and 345398 transitions. Word has length 94 [2025-01-09 04:35:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:57,436 INFO L471 AbstractCegarLoop]: Abstraction has 220587 states and 345398 transitions. [2025-01-09 04:35:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:35:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 220587 states and 345398 transitions. [2025-01-09 04:35:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:35:57,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:57,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:35:57,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:35:57,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:57,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2131366022, now seen corresponding path program 1 times [2025-01-09 04:35:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:57,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049391301] [2025-01-09 04:35:57,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:57,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:35:57,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:35:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:35:57,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049391301] [2025-01-09 04:35:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049391301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:57,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795479008] [2025-01-09 04:35:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:57,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:57,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:57,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:57,514 INFO L87 Difference]: Start difference. First operand 220587 states and 345398 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:35:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:59,042 INFO L93 Difference]: Finished difference Result 367027 states and 576201 transitions. [2025-01-09 04:35:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:59,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:35:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:59,450 INFO L225 Difference]: With dead ends: 367027 [2025-01-09 04:35:59,451 INFO L226 Difference]: Without dead ends: 233415 [2025-01-09 04:35:59,579 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:35:59,580 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 212 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:59,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 636 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233415 states. [2025-01-09 04:36:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233415 to 145933. [2025-01-09 04:36:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145933 states, 145932 states have (on average 1.5632212263245895) internal successors, (228124), 145932 states have internal predecessors, (228124), 0 states have call successors, (0), 0 states have 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:36:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145933 states to 145933 states and 228124 transitions. [2025-01-09 04:36:02,094 INFO L78 Accepts]: Start accepts. Automaton has 145933 states and 228124 transitions. Word has length 94 [2025-01-09 04:36:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:02,095 INFO L471 AbstractCegarLoop]: Abstraction has 145933 states and 228124 transitions. [2025-01-09 04:36:02,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:36:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 145933 states and 228124 transitions. [2025-01-09 04:36:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:36:02,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:02,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:02,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:36:02,097 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:02,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash -860725824, now seen corresponding path program 1 times [2025-01-09 04:36:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450906331] [2025-01-09 04:36:02,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:36:02,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:36:02,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:02,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:02,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450906331] [2025-01-09 04:36:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450906331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:02,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588214660] [2025-01-09 04:36:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:02,163 INFO L87 Difference]: Start difference. First operand 145933 states and 228124 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:03,655 INFO L93 Difference]: Finished difference Result 429145 states and 670652 transitions. [2025-01-09 04:36:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:36:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:04,658 INFO L225 Difference]: With dead ends: 429145 [2025-01-09 04:36:04,658 INFO L226 Difference]: Without dead ends: 283341 [2025-01-09 04:36:04,762 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:36:04,762 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 135 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:04,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 457 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:36:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283341 states. [2025-01-09 04:36:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283341 to 283339. [2025-01-09 04:36:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283339 states, 283338 states have (on average 1.55093563164842) internal successors, (439439), 283338 states have internal predecessors, (439439), 0 states have call successors, (0), 0 states have 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:36:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283339 states to 283339 states and 439439 transitions. [2025-01-09 04:36:08,784 INFO L78 Accepts]: Start accepts. Automaton has 283339 states and 439439 transitions. Word has length 94 [2025-01-09 04:36:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:08,784 INFO L471 AbstractCegarLoop]: Abstraction has 283339 states and 439439 transitions. [2025-01-09 04:36:08,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 283339 states and 439439 transitions. [2025-01-09 04:36:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:36:08,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:08,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:36:08,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1837096547, now seen corresponding path program 1 times [2025-01-09 04:36:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652622831] [2025-01-09 04:36:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:08,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:36:08,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:36:08,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:08,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:36:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652622831] [2025-01-09 04:36:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652622831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014935502] [2025-01-09 04:36:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:08,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:08,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:08,873 INFO L87 Difference]: Start difference. First operand 283339 states and 439439 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:10,667 INFO L93 Difference]: Finished difference Result 499761 states and 780114 transitions. [2025-01-09 04:36:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:36:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:11,378 INFO L225 Difference]: With dead ends: 499761 [2025-01-09 04:36:11,378 INFO L226 Difference]: Without dead ends: 392015 [2025-01-09 04:36:11,502 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:36:11,504 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 213 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:11,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 636 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392015 states. [2025-01-09 04:36:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392015 to 349691. [2025-01-09 04:36:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349691 states, 349690 states have (on average 1.550627698818954) internal successors, (542239), 349690 states have internal predecessors, (542239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)