./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/eca-rers2012/Problem11_label33.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1'] 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/eca-rers2012/Problem11_label33.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 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:38:56,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:38:56,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:38:56,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:38:56,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:38:56,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:38:56,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:38:56,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:38:56,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:38:56,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:38:56,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:38:56,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:38:56,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:38:56,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:38:56,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:38:56,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:38:56,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:38:56,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:38:56,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:38:56,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:38:56,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:38:56,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:38:56,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:38:56,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:38:56,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:38:56,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:38:56,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:38:56,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:38:56,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:38:56,621 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 -> 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 [2024-11-06 19:38:56,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:38:56,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:38:56,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:38:56,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:38:56,892 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:38:56,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2024-11-06 19:38:58,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:38:58,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:38:58,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2024-11-06 19:38:58,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd782832/7d93b0e23abd4dd9ba0541d56ce69ecd/FLAGcaaa0ecb7 [2024-11-06 19:38:58,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd782832/7d93b0e23abd4dd9ba0541d56ce69ecd [2024-11-06 19:38:58,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:38:58,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:38:58,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:38:58,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:38:58,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:38:58,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:38:58" (1/1) ... [2024-11-06 19:38:58,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e5e3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:58, skipping insertion in model container [2024-11-06 19:38:58,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:38:58" (1/1) ... [2024-11-06 19:38:58,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:38:58,961 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/eca-rers2012/Problem11_label33.c[4121,4134] [2024-11-06 19:38:59,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:38:59,153 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:38:59,177 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/eca-rers2012/Problem11_label33.c[4121,4134] [2024-11-06 19:38:59,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:38:59,308 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:38:59,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59 WrapperNode [2024-11-06 19:38:59,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:38:59,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:38:59,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:38:59,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:38:59,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,426 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:38:59,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:38:59,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:38:59,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:38:59,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:38:59,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,489 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]. [2024-11-06 19:38:59,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:38:59,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:38:59,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:38:59,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:38:59,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (1/1) ... [2024-11-06 19:38:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:38:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:38:59,666 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) [2024-11-06 19:38:59,668 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 [2024-11-06 19:38:59,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:38:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:38:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:38:59,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:38:59,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:38:59,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:39:01,395 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:39:01,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:39:01,408 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:39:01,409 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:39:01,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:01 BoogieIcfgContainer [2024-11-06 19:39:01,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:39:01,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:39:01,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:39:01,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:39:01,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:38:58" (1/3) ... [2024-11-06 19:39:01,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1fa608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:01, skipping insertion in model container [2024-11-06 19:39:01,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:38:59" (2/3) ... [2024-11-06 19:39:01,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1fa608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:01, skipping insertion in model container [2024-11-06 19:39:01,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:01" (3/3) ... [2024-11-06 19:39:01,417 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label33.c [2024-11-06 19:39:01,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:39:01,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:39:01,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:39:01,495 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;@7a36663e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:39:01,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:39:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 19:39:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:01,510 INFO L215 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] [2024-11-06 19:39:01,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2024-11-06 19:39:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675118032] [2024-11-06 19:39:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:01,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675118032] [2024-11-06 19:39:01,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675118032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:01,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:01,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988135093] [2024-11-06 19:39:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:01,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:01,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:01,838 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:02,956 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-06 19:39:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-06 19:39:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:02,967 INFO L225 Difference]: With dead ends: 761 [2024-11-06 19:39:02,967 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:39:02,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:02,976 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 200 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:02,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:39:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:39:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-06 19:39:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-06 19:39:03,044 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 28 [2024-11-06 19:39:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:03,044 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-06 19:39:03,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-06 19:39:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 19:39:03,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:03,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:39:03,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:03,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1836683206, now seen corresponding path program 1 times [2024-11-06 19:39:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:03,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750497424] [2024-11-06 19:39:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:03,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750497424] [2024-11-06 19:39:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750497424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106108318] [2024-11-06 19:39:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:03,301 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:04,082 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-06 19:39:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-06 19:39:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:04,089 INFO L225 Difference]: With dead ends: 1211 [2024-11-06 19:39:04,089 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:39:04,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:04,091 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:04,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:39:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-06 19:39:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-06 19:39:04,120 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 96 [2024-11-06 19:39:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:04,121 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-06 19:39:04,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-06 19:39:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 19:39:04,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:04,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:04,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:39:04,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 867693909, now seen corresponding path program 1 times [2024-11-06 19:39:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198143466] [2024-11-06 19:39:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:04,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198143466] [2024-11-06 19:39:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198143466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343990762] [2024-11-06 19:39:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:04,504 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:05,178 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-06 19:39:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-06 19:39:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:05,183 INFO L225 Difference]: With dead ends: 1945 [2024-11-06 19:39:05,183 INFO L226 Difference]: Without dead ends: 1158 [2024-11-06 19:39:05,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:05,185 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:05,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-06 19:39:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-06 19:39:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-06 19:39:05,213 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 98 [2024-11-06 19:39:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-06 19:39:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-06 19:39:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-06 19:39:05,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:05,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:39:05,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1002850089, now seen corresponding path program 1 times [2024-11-06 19:39:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923631597] [2024-11-06 19:39:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923631597] [2024-11-06 19:39:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923631597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447030463] [2024-11-06 19:39:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:05,445 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:06,209 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-06 19:39:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-06 19:39:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:06,215 INFO L225 Difference]: With dead ends: 2519 [2024-11-06 19:39:06,215 INFO L226 Difference]: Without dead ends: 1548 [2024-11-06 19:39:06,217 INFO L431 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 [2024-11-06 19:39:06,218 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:06,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-06 19:39:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-06 19:39:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-06 19:39:06,269 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 155 [2024-11-06 19:39:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-06 19:39:06,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-06 19:39:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-06 19:39:06,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:06,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:06,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:39:06,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:06,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash -85004655, now seen corresponding path program 1 times [2024-11-06 19:39:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856999409] [2024-11-06 19:39:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 19:39:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856999409] [2024-11-06 19:39:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856999409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121095917] [2024-11-06 19:39:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:06,574 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:07,379 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2024-11-06 19:39:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 210 [2024-11-06 19:39:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:07,389 INFO L225 Difference]: With dead ends: 3650 [2024-11-06 19:39:07,389 INFO L226 Difference]: Without dead ends: 2291 [2024-11-06 19:39:07,391 INFO L431 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 [2024-11-06 19:39:07,392 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:07,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-06 19:39:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2024-11-06 19:39:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2024-11-06 19:39:07,447 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 210 [2024-11-06 19:39:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2024-11-06 19:39:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2024-11-06 19:39:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-06 19:39:07,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:07,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:07,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:39:07,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 78170338, now seen corresponding path program 1 times [2024-11-06 19:39:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289065150] [2024-11-06 19:39:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:39:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289065150] [2024-11-06 19:39:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289065150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136977080] [2024-11-06 19:39:07,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:07,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:07,658 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:08,435 INFO L93 Difference]: Finished difference Result 5851 states and 7488 transitions. [2024-11-06 19:39:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:08,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 216 [2024-11-06 19:39:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:08,449 INFO L225 Difference]: With dead ends: 5851 [2024-11-06 19:39:08,450 INFO L226 Difference]: Without dead ends: 3755 [2024-11-06 19:39:08,452 INFO L431 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 [2024-11-06 19:39:08,453 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:08,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-06 19:39:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2024-11-06 19:39:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions. [2024-11-06 19:39:08,524 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 216 [2024-11-06 19:39:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:08,525 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions. [2024-11-06 19:39:08,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions. [2024-11-06 19:39:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-06 19:39:08,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:08,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:08,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:39:08,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 964138675, now seen corresponding path program 1 times [2024-11-06 19:39:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687710567] [2024-11-06 19:39:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:09,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:09,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687710567] [2024-11-06 19:39:09,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687710567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:09,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365199372] [2024-11-06 19:39:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:09,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 19:39:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 19:39:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:39:09,209 INFO L87 Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:10,955 INFO L93 Difference]: Finished difference Result 13433 states and 17026 transitions. [2024-11-06 19:39:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 19:39:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-11-06 19:39:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:10,986 INFO L225 Difference]: With dead ends: 13433 [2024-11-06 19:39:10,986 INFO L226 Difference]: Without dead ends: 9680 [2024-11-06 19:39:10,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:39:10,993 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 416 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:10,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 82 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 19:39:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2024-11-06 19:39:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9475. [2024-11-06 19:39:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9475 states, 9474 states have (on average 1.21638167616635) internal successors, (11524), 9474 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9475 states to 9475 states and 11524 transitions. [2024-11-06 19:39:11,176 INFO L78 Accepts]: Start accepts. Automaton has 9475 states and 11524 transitions. Word has length 247 [2024-11-06 19:39:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 9475 states and 11524 transitions. [2024-11-06 19:39:11,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9475 states and 11524 transitions. [2024-11-06 19:39:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-06 19:39:11,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:11,186 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:39:11,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:39:11,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 640219882, now seen corresponding path program 1 times [2024-11-06 19:39:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693301207] [2024-11-06 19:39:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-06 19:39:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693301207] [2024-11-06 19:39:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693301207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464252013] [2024-11-06 19:39:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:11,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:11,426 INFO L87 Difference]: Start difference. First operand 9475 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:12,205 INFO L93 Difference]: Finished difference Result 21155 states and 26096 transitions. [2024-11-06 19:39:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 293 [2024-11-06 19:39:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:12,240 INFO L225 Difference]: With dead ends: 21155 [2024-11-06 19:39:12,240 INFO L226 Difference]: Without dead ends: 12050 [2024-11-06 19:39:12,251 INFO L431 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 [2024-11-06 19:39:12,252 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 195 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:12,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2024-11-06 19:39:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 9468. [2024-11-06 19:39:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9468 states, 9467 states have (on average 1.2162247808175768) internal successors, (11514), 9467 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 11514 transitions. [2024-11-06 19:39:12,470 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 11514 transitions. Word has length 293 [2024-11-06 19:39:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 9468 states and 11514 transitions. [2024-11-06 19:39:12,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 11514 transitions. [2024-11-06 19:39:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-06 19:39:12,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:12,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:39:12,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 117863084, now seen corresponding path program 1 times [2024-11-06 19:39:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685632597] [2024-11-06 19:39:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:12,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685632597] [2024-11-06 19:39:12,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685632597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:12,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:12,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431584395] [2024-11-06 19:39:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:12,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:12,789 INFO L87 Difference]: Start difference. First operand 9468 states and 11514 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:13,534 INFO L93 Difference]: Finished difference Result 20054 states and 24754 transitions. [2024-11-06 19:39:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2024-11-06 19:39:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:13,567 INFO L225 Difference]: With dead ends: 20054 [2024-11-06 19:39:13,568 INFO L226 Difference]: Without dead ends: 10956 [2024-11-06 19:39:13,578 INFO L431 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 [2024-11-06 19:39:13,579 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 335 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2024-11-06 19:39:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10756. [2024-11-06 19:39:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10756 states, 10755 states have (on average 1.20371920037192) internal successors, (12946), 10755 states have internal predecessors, (12946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 12946 transitions. [2024-11-06 19:39:13,796 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 12946 transitions. Word has length 298 [2024-11-06 19:39:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:13,796 INFO L471 AbstractCegarLoop]: Abstraction has 10756 states and 12946 transitions. [2024-11-06 19:39:13,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 12946 transitions. [2024-11-06 19:39:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-06 19:39:13,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:13,809 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:39:13,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1642030569, now seen corresponding path program 1 times [2024-11-06 19:39:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243442965] [2024-11-06 19:39:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:39:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243442965] [2024-11-06 19:39:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243442965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111429887] [2024-11-06 19:39:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:14,056 INFO L87 Difference]: Start difference. First operand 10756 states and 12946 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:14,797 INFO L93 Difference]: Finished difference Result 20377 states and 24418 transitions. [2024-11-06 19:39:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 312 [2024-11-06 19:39:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:14,818 INFO L225 Difference]: With dead ends: 20377 [2024-11-06 19:39:14,819 INFO L226 Difference]: Without dead ends: 9991 [2024-11-06 19:39:14,829 INFO L431 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 [2024-11-06 19:39:14,832 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:14,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2024-11-06 19:39:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 7599. [2024-11-06 19:39:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7599 states, 7598 states have (on average 1.1417478283758884) internal successors, (8675), 7598 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 8675 transitions. [2024-11-06 19:39:14,978 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 8675 transitions. Word has length 312 [2024-11-06 19:39:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:14,979 INFO L471 AbstractCegarLoop]: Abstraction has 7599 states and 8675 transitions. [2024-11-06 19:39:14,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 8675 transitions. [2024-11-06 19:39:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-06 19:39:14,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:14,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:39:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:39:14,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:14,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1079031194, now seen corresponding path program 1 times [2024-11-06 19:39:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418619536] [2024-11-06 19:39:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-06 19:39:15,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418619536] [2024-11-06 19:39:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418619536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:15,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:15,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692304533] [2024-11-06 19:39:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:15,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:15,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:15,369 INFO L87 Difference]: Start difference. First operand 7599 states and 8675 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:16,147 INFO L93 Difference]: Finished difference Result 17772 states and 20278 transitions. [2024-11-06 19:39:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 397 [2024-11-06 19:39:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:16,167 INFO L225 Difference]: With dead ends: 17772 [2024-11-06 19:39:16,168 INFO L226 Difference]: Without dead ends: 9802 [2024-11-06 19:39:16,177 INFO L431 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 [2024-11-06 19:39:16,177 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 121 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:16,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 315 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2024-11-06 19:39:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8698. [2024-11-06 19:39:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8698 states, 8697 states have (on average 1.134069219271013) internal successors, (9863), 8697 states have internal predecessors, (9863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 9863 transitions. [2024-11-06 19:39:16,288 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 9863 transitions. Word has length 397 [2024-11-06 19:39:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:16,289 INFO L471 AbstractCegarLoop]: Abstraction has 8698 states and 9863 transitions. [2024-11-06 19:39:16,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 9863 transitions. [2024-11-06 19:39:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-06 19:39:16,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:16,303 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:16,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:39:16,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:16,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash 145108911, now seen corresponding path program 1 times [2024-11-06 19:39:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956221548] [2024-11-06 19:39:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:39:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956221548] [2024-11-06 19:39:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956221548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 19:39:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504618452] [2024-11-06 19:39:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:17,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 19:39:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 19:39:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:39:17,436 INFO L87 Difference]: Start difference. First operand 8698 states and 9863 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:18,862 INFO L93 Difference]: Finished difference Result 19976 states and 22629 transitions. [2024-11-06 19:39:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 19:39:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 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 398 [2024-11-06 19:39:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:18,886 INFO L225 Difference]: With dead ends: 19976 [2024-11-06 19:39:18,886 INFO L226 Difference]: Without dead ends: 11648 [2024-11-06 19:39:18,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:39:18,897 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 251 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:18,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 219 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:39:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2024-11-06 19:39:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11461. [2024-11-06 19:39:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 11460 states have (on average 1.1300174520069808) internal successors, (12950), 11460 states have internal predecessors, (12950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 12950 transitions. [2024-11-06 19:39:19,044 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 12950 transitions. Word has length 398 [2024-11-06 19:39:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 11461 states and 12950 transitions. [2024-11-06 19:39:19,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 12950 transitions. [2024-11-06 19:39:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-06 19:39:19,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:19,060 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:19,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:39:19,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:19,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 504044406, now seen corresponding path program 1 times [2024-11-06 19:39:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318427129] [2024-11-06 19:39:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 357 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:39:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318427129] [2024-11-06 19:39:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318427129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:39:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977883843] [2024-11-06 19:39:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:39:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:20,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:39:20,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:39:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:20,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:39:20,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:39:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:39:21,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:39:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:39:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977883843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:39:24,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:39:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-06 19:39:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123700728] [2024-11-06 19:39:24,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:39:24,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 19:39:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:24,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 19:39:24,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-06 19:39:24,838 INFO L87 Difference]: Start difference. First operand 11461 states and 12950 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:28,964 INFO L93 Difference]: Finished difference Result 30294 states and 34108 transitions. [2024-11-06 19:39:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 19:39:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 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 408 [2024-11-06 19:39:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:28,990 INFO L225 Difference]: With dead ends: 30294 [2024-11-06 19:39:28,990 INFO L226 Difference]: Without dead ends: 18465 [2024-11-06 19:39:29,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-06 19:39:29,003 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1368 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 5236 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 5236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:29,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 257 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 5236 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 19:39:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18465 states. [2024-11-06 19:39:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18465 to 10723. [2024-11-06 19:39:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10723 states, 10722 states have (on average 1.104178324939377) internal successors, (11839), 10722 states have internal predecessors, (11839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10723 states to 10723 states and 11839 transitions. [2024-11-06 19:39:29,197 INFO L78 Accepts]: Start accepts. Automaton has 10723 states and 11839 transitions. Word has length 408 [2024-11-06 19:39:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:29,198 INFO L471 AbstractCegarLoop]: Abstraction has 10723 states and 11839 transitions. [2024-11-06 19:39:29,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10723 states and 11839 transitions. [2024-11-06 19:39:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-06 19:39:29,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:29,210 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:29,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 19:39:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 19:39:29,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1509289490, now seen corresponding path program 1 times [2024-11-06 19:39:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243145553] [2024-11-06 19:39:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243145553] [2024-11-06 19:39:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243145553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189052388] [2024-11-06 19:39:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:29,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:29,770 INFO L87 Difference]: Start difference. First operand 10723 states and 11839 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:30,692 INFO L93 Difference]: Finished difference Result 23476 states and 25909 transitions. [2024-11-06 19:39:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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 430 [2024-11-06 19:39:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:30,711 INFO L225 Difference]: With dead ends: 23476 [2024-11-06 19:39:30,711 INFO L226 Difference]: Without dead ends: 13123 [2024-11-06 19:39:30,719 INFO L431 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 [2024-11-06 19:39:30,719 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 180 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:30,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 63 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:39:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2024-11-06 19:39:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 12386. [2024-11-06 19:39:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 12385 states have (on average 1.09245054501413) internal successors, (13530), 12385 states have internal predecessors, (13530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 13530 transitions. [2024-11-06 19:39:30,864 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 13530 transitions. Word has length 430 [2024-11-06 19:39:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:30,865 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 13530 transitions. [2024-11-06 19:39:30,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 13530 transitions. [2024-11-06 19:39:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-11-06 19:39:30,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:30,876 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:30,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:39:30,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1406221149, now seen corresponding path program 1 times [2024-11-06 19:39:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590622859] [2024-11-06 19:39:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-06 19:39:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590622859] [2024-11-06 19:39:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590622859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321165158] [2024-11-06 19:39:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:31,186 INFO L87 Difference]: Start difference. First operand 12386 states and 13530 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:31,796 INFO L93 Difference]: Finished difference Result 26426 states and 28854 transitions. [2024-11-06 19:39:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 445 [2024-11-06 19:39:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:31,819 INFO L225 Difference]: With dead ends: 26426 [2024-11-06 19:39:31,819 INFO L226 Difference]: Without dead ends: 12568 [2024-11-06 19:39:31,830 INFO L431 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 [2024-11-06 19:39:31,831 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:31,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2024-11-06 19:39:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 10911. [2024-11-06 19:39:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10911 states, 10910 states have (on average 1.0778185151237396) internal successors, (11759), 10910 states have internal predecessors, (11759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10911 states to 10911 states and 11759 transitions. [2024-11-06 19:39:32,021 INFO L78 Accepts]: Start accepts. Automaton has 10911 states and 11759 transitions. Word has length 445 [2024-11-06 19:39:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 10911 states and 11759 transitions. [2024-11-06 19:39:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10911 states and 11759 transitions. [2024-11-06 19:39:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-06 19:39:32,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:32,038 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:39:32,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 546987130, now seen corresponding path program 1 times [2024-11-06 19:39:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137561374] [2024-11-06 19:39:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-06 19:39:32,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137561374] [2024-11-06 19:39:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137561374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608569063] [2024-11-06 19:39:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:32,252 INFO L87 Difference]: Start difference. First operand 10911 states and 11759 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:32,800 INFO L93 Difference]: Finished difference Result 22555 states and 24296 transitions. [2024-11-06 19:39:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 483 [2024-11-06 19:39:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:32,811 INFO L225 Difference]: With dead ends: 22555 [2024-11-06 19:39:32,811 INFO L226 Difference]: Without dead ends: 12014 [2024-11-06 19:39:32,818 INFO L431 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 [2024-11-06 19:39:32,818 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:32,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2024-11-06 19:39:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11830. [2024-11-06 19:39:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.0695747738608505) internal successors, (12652), 11829 states have internal predecessors, (12652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 12652 transitions. [2024-11-06 19:39:32,937 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 12652 transitions. Word has length 483 [2024-11-06 19:39:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:32,938 INFO L471 AbstractCegarLoop]: Abstraction has 11830 states and 12652 transitions. [2024-11-06 19:39:32,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 12652 transitions. [2024-11-06 19:39:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-06 19:39:32,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:32,950 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:32,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:39:32,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1451405169, now seen corresponding path program 1 times [2024-11-06 19:39:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683132820] [2024-11-06 19:39:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-06 19:39:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683132820] [2024-11-06 19:39:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683132820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200764299] [2024-11-06 19:39:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:33,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:33,419 INFO L87 Difference]: Start difference. First operand 11830 states and 12652 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:34,213 INFO L93 Difference]: Finished difference Result 24032 states and 25730 transitions. [2024-11-06 19:39:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 483 [2024-11-06 19:39:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:34,226 INFO L225 Difference]: With dead ends: 24032 [2024-11-06 19:39:34,226 INFO L226 Difference]: Without dead ends: 12572 [2024-11-06 19:39:34,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:34,235 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 214 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2024-11-06 19:39:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 12016. [2024-11-06 19:39:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0689138576779027) internal successors, (12843), 12015 states have internal predecessors, (12843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12843 transitions. [2024-11-06 19:39:34,341 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12843 transitions. Word has length 483 [2024-11-06 19:39:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:34,341 INFO L471 AbstractCegarLoop]: Abstraction has 12016 states and 12843 transitions. [2024-11-06 19:39:34,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12843 transitions. [2024-11-06 19:39:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-11-06 19:39:34,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:34,347 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:39:34,348 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 704365135, now seen corresponding path program 1 times [2024-11-06 19:39:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056682112] [2024-11-06 19:39:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-06 19:39:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056682112] [2024-11-06 19:39:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056682112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:34,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:34,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:34,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684825875] [2024-11-06 19:39:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:34,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:34,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:34,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:34,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:34,647 INFO L87 Difference]: Start difference. First operand 12016 states and 12843 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:35,185 INFO L93 Difference]: Finished difference Result 24033 states and 25696 transitions. [2024-11-06 19:39:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:35,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 488 [2024-11-06 19:39:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:35,196 INFO L225 Difference]: With dead ends: 24033 [2024-11-06 19:39:35,196 INFO L226 Difference]: Without dead ends: 12203 [2024-11-06 19:39:35,203 INFO L431 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 [2024-11-06 19:39:35,204 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:35,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 323 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2024-11-06 19:39:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 12015. [2024-11-06 19:39:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12015 states, 12014 states have (on average 1.057516231063759) internal successors, (12705), 12014 states have internal predecessors, (12705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 12705 transitions. [2024-11-06 19:39:35,296 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 12705 transitions. Word has length 488 [2024-11-06 19:39:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 12015 states and 12705 transitions. [2024-11-06 19:39:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 12705 transitions. [2024-11-06 19:39:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-11-06 19:39:35,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:35,305 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:35,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:39:35,305 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1341858608, now seen corresponding path program 1 times [2024-11-06 19:39:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405030725] [2024-11-06 19:39:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:35,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-06 19:39:35,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405030725] [2024-11-06 19:39:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405030725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590365956] [2024-11-06 19:39:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:35,636 INFO L87 Difference]: Start difference. First operand 12015 states and 12705 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:36,197 INFO L93 Difference]: Finished difference Result 25515 states and 27017 transitions. [2024-11-06 19:39:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:36,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 497 [2024-11-06 19:39:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:36,208 INFO L225 Difference]: With dead ends: 25515 [2024-11-06 19:39:36,208 INFO L226 Difference]: Without dead ends: 13870 [2024-11-06 19:39:36,215 INFO L431 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 [2024-11-06 19:39:36,215 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:36,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 135 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2024-11-06 19:39:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 12567. [2024-11-06 19:39:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12567 states, 12566 states have (on average 1.0563425115390737) internal successors, (13274), 12566 states have internal predecessors, (13274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12567 states to 12567 states and 13274 transitions. [2024-11-06 19:39:36,318 INFO L78 Accepts]: Start accepts. Automaton has 12567 states and 13274 transitions. Word has length 497 [2024-11-06 19:39:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:36,319 INFO L471 AbstractCegarLoop]: Abstraction has 12567 states and 13274 transitions. [2024-11-06 19:39:36,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12567 states and 13274 transitions. [2024-11-06 19:39:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-11-06 19:39:36,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:36,326 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:36,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 19:39:36,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:36,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1445337457, now seen corresponding path program 1 times [2024-11-06 19:39:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308667626] [2024-11-06 19:39:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-06 19:39:36,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308667626] [2024-11-06 19:39:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308667626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:36,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:36,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:36,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149023551] [2024-11-06 19:39:36,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:36,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:36,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:36,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:36,518 INFO L87 Difference]: Start difference. First operand 12567 states and 13274 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:37,022 INFO L93 Difference]: Finished difference Result 24579 states and 25963 transitions. [2024-11-06 19:39:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 564 [2024-11-06 19:39:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:37,037 INFO L225 Difference]: With dead ends: 24579 [2024-11-06 19:39:37,037 INFO L226 Difference]: Without dead ends: 12382 [2024-11-06 19:39:37,046 INFO L431 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 [2024-11-06 19:39:37,047 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:37,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 325 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:39:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12382 states. [2024-11-06 19:39:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12382 to 12382. [2024-11-06 19:39:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 12381 states have (on average 1.055084403521525) internal successors, (13063), 12381 states have internal predecessors, (13063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 13063 transitions. [2024-11-06 19:39:37,192 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 13063 transitions. Word has length 564 [2024-11-06 19:39:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:37,192 INFO L471 AbstractCegarLoop]: Abstraction has 12382 states and 13063 transitions. [2024-11-06 19:39:37,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 13063 transitions. [2024-11-06 19:39:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2024-11-06 19:39:37,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:37,204 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 19:39:37,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:37,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 688501029, now seen corresponding path program 1 times [2024-11-06 19:39:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603821265] [2024-11-06 19:39:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-06 19:39:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603821265] [2024-11-06 19:39:37,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603821265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:37,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:37,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:37,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759972082] [2024-11-06 19:39:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:37,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:37,528 INFO L87 Difference]: Start difference. First operand 12382 states and 13063 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:38,029 INFO L93 Difference]: Finished difference Result 26049 states and 27494 transitions. [2024-11-06 19:39:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 590 [2024-11-06 19:39:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:38,042 INFO L225 Difference]: With dead ends: 26049 [2024-11-06 19:39:38,042 INFO L226 Difference]: Without dead ends: 14037 [2024-11-06 19:39:38,050 INFO L431 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 [2024-11-06 19:39:38,050 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:38,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 61 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:39:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2024-11-06 19:39:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 12746. [2024-11-06 19:39:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12746 states, 12745 states have (on average 1.0522557865829738) internal successors, (13411), 12745 states have internal predecessors, (13411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12746 states to 12746 states and 13411 transitions. [2024-11-06 19:39:38,196 INFO L78 Accepts]: Start accepts. Automaton has 12746 states and 13411 transitions. Word has length 590 [2024-11-06 19:39:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:38,197 INFO L471 AbstractCegarLoop]: Abstraction has 12746 states and 13411 transitions. [2024-11-06 19:39:38,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12746 states and 13411 transitions. [2024-11-06 19:39:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-11-06 19:39:38,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:38,205 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 19:39:38,206 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 54450342, now seen corresponding path program 1 times [2024-11-06 19:39:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814467202] [2024-11-06 19:39:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-06 19:39:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814467202] [2024-11-06 19:39:38,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814467202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:38,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:38,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496797344] [2024-11-06 19:39:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:38,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:38,583 INFO L87 Difference]: Start difference. First operand 12746 states and 13411 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:39,335 INFO L93 Difference]: Finished difference Result 32132 states and 33819 transitions. [2024-11-06 19:39:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 595 [2024-11-06 19:39:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:39,356 INFO L225 Difference]: With dead ends: 32132 [2024-11-06 19:39:39,356 INFO L226 Difference]: Without dead ends: 19388 [2024-11-06 19:39:39,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:39,366 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 181 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:39,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 71 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19388 states. [2024-11-06 19:39:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19388 to 16250. [2024-11-06 19:39:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0510800664656286) internal successors, (17079), 16249 states have internal predecessors, (17079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17079 transitions. [2024-11-06 19:39:39,546 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17079 transitions. Word has length 595 [2024-11-06 19:39:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:39,546 INFO L471 AbstractCegarLoop]: Abstraction has 16250 states and 17079 transitions. [2024-11-06 19:39:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17079 transitions. [2024-11-06 19:39:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-11-06 19:39:39,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:39,557 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 19:39:39,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 905967947, now seen corresponding path program 1 times [2024-11-06 19:39:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061549484] [2024-11-06 19:39:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-06 19:39:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061549484] [2024-11-06 19:39:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061549484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:40,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189211143] [2024-11-06 19:39:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:40,062 INFO L87 Difference]: Start difference. First operand 16250 states and 17079 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:40,972 INFO L93 Difference]: Finished difference Result 33977 states and 35796 transitions. [2024-11-06 19:39:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:40,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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 601 [2024-11-06 19:39:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:40,985 INFO L225 Difference]: With dead ends: 33977 [2024-11-06 19:39:40,985 INFO L226 Difference]: Without dead ends: 17915 [2024-11-06 19:39:40,994 INFO L431 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 [2024-11-06 19:39:40,994 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:40,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2024-11-06 19:39:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2024-11-06 19:39:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0521525489977106) internal successors, (18843), 17909 states have internal predecessors, (18843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18843 transitions. [2024-11-06 19:39:41,123 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18843 transitions. Word has length 601 [2024-11-06 19:39:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:41,123 INFO L471 AbstractCegarLoop]: Abstraction has 17910 states and 18843 transitions. [2024-11-06 19:39:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18843 transitions. [2024-11-06 19:39:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2024-11-06 19:39:41,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:41,134 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 19:39:41,134 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1278260760, now seen corresponding path program 1 times [2024-11-06 19:39:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472140038] [2024-11-06 19:39:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-11-06 19:39:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472140038] [2024-11-06 19:39:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472140038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91047222] [2024-11-06 19:39:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:41,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:41,676 INFO L87 Difference]: Start difference. First operand 17910 states and 18843 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:42,141 INFO L93 Difference]: Finished difference Result 18097 states and 19041 transitions. [2024-11-06 19:39:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 608 [2024-11-06 19:39:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:42,142 INFO L225 Difference]: With dead ends: 18097 [2024-11-06 19:39:42,142 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:39:42,149 INFO L431 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 [2024-11-06 19:39:42,149 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:42,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:39:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:39:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:39:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:39:42,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2024-11-06 19:39:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:42,150 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:39:42,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:39:42,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:39:42,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:39:42,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-06 19:39:42,155 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-06 19:39:42,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:39:48,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:39:48,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:39:48 BoogieIcfgContainer [2024-11-06 19:39:48,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:39:48,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:39:48,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:39:48,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:39:48,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:01" (3/4) ... [2024-11-06 19:39:48,556 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:39:48,580 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:39:48,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:39:48,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:39:48,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:39:48,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:39:48,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:39:48,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:39:48,828 INFO L158 Benchmark]: Toolchain (without parser) took 50069.30ms. Allocated memory was 100.7MB in the beginning and 335.5MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 230.4MB in the end (delta: -156.2MB). Peak memory consumption was 366.0MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,828 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:39:48,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.58ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 65.9MB in the end (delta: 8.1MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.21ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 48.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,829 INFO L158 Benchmark]: Boogie Preprocessor took 201.16ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 60.7MB in the end (delta: -11.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,829 INFO L158 Benchmark]: RCFGBuilder took 1779.46ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 60.7MB in the beginning and 99.3MB in the end (delta: -38.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,829 INFO L158 Benchmark]: TraceAbstraction took 47141.83ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 98.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-06 19:39:48,829 INFO L158 Benchmark]: Witness Printer took 269.63ms. Allocated memory was 1.6GB in the beginning and 335.5MB in the end (delta: -1.3GB). Free memory was 1.3GB in the beginning and 230.4MB in the end (delta: 1.0GB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-06 19:39:48,834 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.58ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 65.9MB in the end (delta: 8.1MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.21ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 48.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 201.16ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 60.7MB in the end (delta: -11.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1779.46ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 60.7MB in the beginning and 99.3MB in the end (delta: -38.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47141.83ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 98.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 269.63ms. Allocated memory was 1.6GB in the beginning and 335.5MB in the end (delta: -1.3GB). Free memory was 1.3GB in the beginning and 230.4MB in the end (delta: 1.0GB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 100]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5142 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5142 mSDsluCounter, 4968 SdHoareTripleChecker+Invalid, 16.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 2927 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21616 IncrementalHoareTripleChecker+Invalid, 24543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2927 mSolverCounterUnsat, 4153 mSDtfsCounter, 21616 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=23, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 23679 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 9348 NumberOfCodeBlocks, 9348 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9730 ConstructedInterpolants, 0 QuantifiedInterpolants, 33066 SizeOfPredicates, 1 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 12176/12426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a4 == 0) && (a29 <= 274)) && (a23 <= 138)) && (0 <= ((long long) a23 + 42))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((((long long) a23 + 43) <= 0) && (261 <= a29)) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((((a25 == 13) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) || ((a4 == 1) && (a25 == 10))) || ((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (((140 < a29) || (0 < ((long long) a23 + 43))) || (a25 != 9)))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (0 <= ((long long) a29 + 28553))) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((261 <= a29) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (((long long) 119992 + a23) <= 0))) || ((((a4 == 0) && (a25 <= 10)) && (a29 <= 599998)) && (99915 <= a29))) || (((((260 <= a29) && (a25 == 12)) && ((a23 < 307) || (a29 < 278))) && (a4 == 0)) && (a29 <= 599998))) || (((a25 == 11) && (a4 == 1)) && (130 <= a29))) || (((((a25 == 13) && (a23 <= 278)) && (99912 <= a29)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 245)) && (((long long) 119992 + a23) <= 0))) || (((((a25 != 13) || (a23 < 307)) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (99915 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((((a29 <= 245) && (a23 <= 138)) && (a4 == 1)) && (((140 < a29) || (0 < ((long long) a23 + 43))) || (a25 != 9))) && (130 <= a29))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a23 <= 278) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((a23 <= 278) && (a25 == 12)) && (a4 == 1))) || ((((a25 <= 10) && (a4 == 1)) && (((140 < a29) || (0 < ((long long) a23 + 43))) || (a25 != 9))) && (130 <= a29))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) || ((((a25 == 12) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (130 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:39:48,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE