./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label45.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_label45.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', '9cd15529a9b2dd098d5ccb70769668148a833250f0918a0771464210899319de'] 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_label45.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 9cd15529a9b2dd098d5ccb70769668148a833250f0918a0771464210899319de --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:39:32,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:39:32,390 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:39:32,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:39:32,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:39:32,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:39:32,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:39:32,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:39:32,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:39:32,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:39:32,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:39:32,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:39:32,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:39:32,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:39:32,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:39:32,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:39:32,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:39:32,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:39:32,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:39:32,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:39:32,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:39:32,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:39:32,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:39:32,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:39:32,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:39:32,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:39:32,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:32,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:39:32,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:39:32,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:39:32,435 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 -> 9cd15529a9b2dd098d5ccb70769668148a833250f0918a0771464210899319de [2024-11-06 19:39:32,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:39:32,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:39:32,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:39:32,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:39:32,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:39:32,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2024-11-06 19:39:34,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:39:34,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:39:34,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2024-11-06 19:39:34,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a9baa9f1/a21af2bda7d04436af6d4f2117fb89d3/FLAG9b8276258 [2024-11-06 19:39:34,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a9baa9f1/a21af2bda7d04436af6d4f2117fb89d3 [2024-11-06 19:39:34,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:39:34,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:39:34,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:34,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:39:34,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:39:34,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:34,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70459a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34, skipping insertion in model container [2024-11-06 19:39:34,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:34,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:39:34,709 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_label45.c[4714,4727] [2024-11-06 19:39:34,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:34,930 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:39:34,953 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_label45.c[4714,4727] [2024-11-06 19:39:35,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:35,055 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:39:35,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35 WrapperNode [2024-11-06 19:39:35,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:35,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:35,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:39:35,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:39:35,065 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:39:35" (1/1) ... [2024-11-06 19:39:35,094 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:39:35" (1/1) ... [2024-11-06 19:39:35,216 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:39:35,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:35,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:39:35,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:39:35,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:39:35,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,287 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:39:35,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:39:35,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:39:35,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:39:35,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:39:35,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (1/1) ... [2024-11-06 19:39:35,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:35,421 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:39:35,424 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:39:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:39:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:39:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:39:35,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:39:35,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:39:35,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:39:37,278 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:39:37,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:39:37,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:39:37,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:39:37,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:37 BoogieIcfgContainer [2024-11-06 19:39:37,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:39:37,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:39:37,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:39:37,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:39:37,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:39:34" (1/3) ... [2024-11-06 19:39:37,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c41c9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:37, skipping insertion in model container [2024-11-06 19:39:37,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:35" (2/3) ... [2024-11-06 19:39:37,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c41c9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:37, skipping insertion in model container [2024-11-06 19:39:37,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:37" (3/3) ... [2024-11-06 19:39:37,304 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label45.c [2024-11-06 19:39:37,318 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:39:37,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:39:37,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:39:37,398 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;@22e30075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:39:37,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:39:37,406 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:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 19:39:37,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:37,413 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, 1, 1, 1, 1] [2024-11-06 19:39:37,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:37,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2024-11-06 19:39:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555984021] [2024-11-06 19:39:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:37,744 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:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555984021] [2024-11-06 19:39:37,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555984021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:37,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:37,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550203782] [2024-11-06 19:39:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:37,774 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 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:38,937 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-06 19:39:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-06 19:39:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:38,954 INFO L225 Difference]: With dead ends: 776 [2024-11-06 19:39:38,954 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:39:38,958 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:38,963 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 195 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:38,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:39:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:39:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-06 19:39:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 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,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-06 19:39:39,034 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 32 [2024-11-06 19:39:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:39,034 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-06 19:39:39,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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,035 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-06 19:39:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 19:39:39,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:39,040 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, 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] [2024-11-06 19:39:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:39:39,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -841882166, now seen corresponding path program 1 times [2024-11-06 19:39:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60818291] [2024-11-06 19:39:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:39,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60818291] [2024-11-06 19:39:39,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60818291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:39,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:39,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:39,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710002116] [2024-11-06 19:39:39,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:39,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:39,336 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:40,197 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-06 19:39:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-06 19:39:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:40,205 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 19:39:40,205 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:39:40,206 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:40,207 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 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.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:40,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:39:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-06 19:39:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 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,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-06 19:39:40,247 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 100 [2024-11-06 19:39:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-06 19:39:40,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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,248 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-06 19:39:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-06 19:39:40,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:40,251 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, 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] [2024-11-06 19:39:40,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:39:40,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1213530036, now seen corresponding path program 1 times [2024-11-06 19:39:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099182488] [2024-11-06 19:39:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099182488] [2024-11-06 19:39:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099182488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425863491] [2024-11-06 19:39:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:40,691 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:41,391 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-06 19:39:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-06 19:39:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:41,396 INFO L225 Difference]: With dead ends: 1942 [2024-11-06 19:39:41,396 INFO L226 Difference]: Without dead ends: 1157 [2024-11-06 19:39:41,397 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:41,399 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 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.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:41,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-06 19:39:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-06 19:39:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 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,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-06 19:39:41,429 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 101 [2024-11-06 19:39:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:41,429 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-06 19:39:41,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-06 19:39:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 19:39:41,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:41,432 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, 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] [2024-11-06 19:39:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:39:41,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1558160526, now seen corresponding path program 1 times [2024-11-06 19:39:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331951020] [2024-11-06 19:39:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331951020] [2024-11-06 19:39:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331951020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:41,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158634200] [2024-11-06 19:39:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:41,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:41,699 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:42,483 INFO L93 Difference]: Finished difference Result 2691 states and 3515 transitions. [2024-11-06 19:39:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-06 19:39:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:42,490 INFO L225 Difference]: With dead ends: 2691 [2024-11-06 19:39:42,491 INFO L226 Difference]: Without dead ends: 1721 [2024-11-06 19:39:42,493 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,494 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 174 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:42,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-06 19:39:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2024-11-06 19:39:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.261296660117878) internal successors, (1926), 1527 states have internal predecessors, (1926), 0 states have call successors, (0), 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,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1926 transitions. [2024-11-06 19:39:42,537 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1926 transitions. Word has length 144 [2024-11-06 19:39:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:42,537 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1926 transitions. [2024-11-06 19:39:42,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1926 transitions. [2024-11-06 19:39:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-06 19:39:42,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:42,541 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, 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] [2024-11-06 19:39:42,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:39:42,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1735014295, now seen corresponding path program 1 times [2024-11-06 19:39:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141219217] [2024-11-06 19:39:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141219217] [2024-11-06 19:39:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141219217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049298844] [2024-11-06 19:39:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:42,695 INFO L87 Difference]: Start difference. First operand 1528 states and 1926 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:43,447 INFO L93 Difference]: Finished difference Result 4158 states and 5316 transitions. [2024-11-06 19:39:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-11-06 19:39:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:43,458 INFO L225 Difference]: With dead ends: 4158 [2024-11-06 19:39:43,459 INFO L226 Difference]: Without dead ends: 2632 [2024-11-06 19:39:43,461 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:43,463 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:43,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2024-11-06 19:39:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2448. [2024-11-06 19:39:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.2174090723334696) internal successors, (2979), 2447 states have internal predecessors, (2979), 0 states have call successors, (0), 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:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 2979 transitions. [2024-11-06 19:39:43,513 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 2979 transitions. Word has length 159 [2024-11-06 19:39:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:43,514 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 2979 transitions. [2024-11-06 19:39:43,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2979 transitions. [2024-11-06 19:39:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-06 19:39:43,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:43,517 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:39:43,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1522747337, now seen corresponding path program 1 times [2024-11-06 19:39:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779766577] [2024-11-06 19:39:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779766577] [2024-11-06 19:39:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779766577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077306892] [2024-11-06 19:39:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:43,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:43,694 INFO L87 Difference]: Start difference. First operand 2448 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:44,456 INFO L93 Difference]: Finished difference Result 5639 states and 6868 transitions. [2024-11-06 19:39:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-11-06 19:39:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:44,472 INFO L225 Difference]: With dead ends: 5639 [2024-11-06 19:39:44,473 INFO L226 Difference]: Without dead ends: 3193 [2024-11-06 19:39:44,477 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:44,480 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:44,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 359 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-11-06 19:39:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3184. [2024-11-06 19:39:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.1991831605403707) internal successors, (3817), 3183 states have internal predecessors, (3817), 0 states have call successors, (0), 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:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3817 transitions. [2024-11-06 19:39:44,549 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 3817 transitions. Word has length 175 [2024-11-06 19:39:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:44,550 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 3817 transitions. [2024-11-06 19:39:44,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3817 transitions. [2024-11-06 19:39:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-06 19:39:44,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:44,553 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:39:44,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash -72568345, now seen corresponding path program 1 times [2024-11-06 19:39:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271042400] [2024-11-06 19:39:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 19:39:44,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:44,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271042400] [2024-11-06 19:39:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271042400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:44,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252775247] [2024-11-06 19:39:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:44,858 INFO L87 Difference]: Start difference. First operand 3184 states and 3817 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:45,537 INFO L93 Difference]: Finished difference Result 7108 states and 8504 transitions. [2024-11-06 19:39:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 213 [2024-11-06 19:39:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:45,555 INFO L225 Difference]: With dead ends: 7108 [2024-11-06 19:39:45,555 INFO L226 Difference]: Without dead ends: 3926 [2024-11-06 19:39:45,559 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:45,560 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:45,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2024-11-06 19:39:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3925. [2024-11-06 19:39:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3924 states have (on average 1.193934760448522) internal successors, (4685), 3924 states have internal predecessors, (4685), 0 states have call successors, (0), 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:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4685 transitions. [2024-11-06 19:39:45,669 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4685 transitions. Word has length 213 [2024-11-06 19:39:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:45,670 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 4685 transitions. [2024-11-06 19:39:45,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4685 transitions. [2024-11-06 19:39:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-06 19:39:45,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:45,673 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:39:45,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1355790433, now seen corresponding path program 1 times [2024-11-06 19:39:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085288840] [2024-11-06 19:39:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 19:39:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085288840] [2024-11-06 19:39:45,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085288840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:45,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:45,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478663102] [2024-11-06 19:39:45,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:45,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:45,883 INFO L87 Difference]: Start difference. First operand 3925 states and 4685 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:46,768 INFO L93 Difference]: Finished difference Result 8591 states and 10347 transitions. [2024-11-06 19:39:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 214 [2024-11-06 19:39:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:46,786 INFO L225 Difference]: With dead ends: 8591 [2024-11-06 19:39:46,787 INFO L226 Difference]: Without dead ends: 4668 [2024-11-06 19:39:46,792 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:46,792 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:46,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 390 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2024-11-06 19:39:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4477. [2024-11-06 19:39:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1861036639857014) internal successors, (5309), 4476 states have internal predecessors, (5309), 0 states have call successors, (0), 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:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5309 transitions. [2024-11-06 19:39:46,888 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5309 transitions. Word has length 214 [2024-11-06 19:39:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:46,889 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5309 transitions. [2024-11-06 19:39:46,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5309 transitions. [2024-11-06 19:39:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-06 19:39:46,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:46,893 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, 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, 1, 1, 1, 1, 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:46,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:39:46,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1305427345, now seen corresponding path program 1 times [2024-11-06 19:39:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:46,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310836638] [2024-11-06 19:39:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310836638] [2024-11-06 19:39:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310836638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833083367] [2024-11-06 19:39:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:47,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:47,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:47,282 INFO L87 Difference]: Start difference. First operand 4477 states and 5309 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:48,674 INFO L93 Difference]: Finished difference Result 14323 states and 17015 transitions. [2024-11-06 19:39:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:48,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2024-11-06 19:39:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:48,721 INFO L225 Difference]: With dead ends: 14323 [2024-11-06 19:39:48,721 INFO L226 Difference]: Without dead ends: 9848 [2024-11-06 19:39:48,732 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:48,733 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 308 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:48,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 193 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:39:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2024-11-06 19:39:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 7627. [2024-11-06 19:39:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7627 states, 7626 states have (on average 1.1706005769735117) internal successors, (8927), 7626 states have internal predecessors, (8927), 0 states have call successors, (0), 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:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 8927 transitions. [2024-11-06 19:39:48,880 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 8927 transitions. Word has length 234 [2024-11-06 19:39:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:48,880 INFO L471 AbstractCegarLoop]: Abstraction has 7627 states and 8927 transitions. [2024-11-06 19:39:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 8927 transitions. [2024-11-06 19:39:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-06 19:39:48,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:48,885 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:39:48,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1724103242, now seen corresponding path program 1 times [2024-11-06 19:39:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810000125] [2024-11-06 19:39:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810000125] [2024-11-06 19:39:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810000125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827126896] [2024-11-06 19:39:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:49,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:49,232 INFO L87 Difference]: Start difference. First operand 7627 states and 8927 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:50,665 INFO L93 Difference]: Finished difference Result 20232 states and 23754 transitions. [2024-11-06 19:39:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-06 19:39:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:50,691 INFO L225 Difference]: With dead ends: 20232 [2024-11-06 19:39:50,691 INFO L226 Difference]: Without dead ends: 12607 [2024-11-06 19:39:50,702 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:50,703 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 326 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:50,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 108 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:39:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12607 states. [2024-11-06 19:39:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12607 to 10202. [2024-11-06 19:39:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.1737084599549064) internal successors, (11973), 10201 states have internal predecessors, (11973), 0 states have call successors, (0), 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:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 11973 transitions. [2024-11-06 19:39:50,885 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 11973 transitions. Word has length 244 [2024-11-06 19:39:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:50,886 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 11973 transitions. [2024-11-06 19:39:50,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 11973 transitions. [2024-11-06 19:39:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-06 19:39:50,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:50,891 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:39:50,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1778292591, now seen corresponding path program 1 times [2024-11-06 19:39:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45239083] [2024-11-06 19:39:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45239083] [2024-11-06 19:39:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45239083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72109294] [2024-11-06 19:39:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:51,113 INFO L87 Difference]: Start difference. First operand 10202 states and 11973 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:51,869 INFO L93 Difference]: Finished difference Result 20399 states and 23941 transitions. [2024-11-06 19:39:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:51,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-06 19:39:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:51,892 INFO L225 Difference]: With dead ends: 20399 [2024-11-06 19:39:51,892 INFO L226 Difference]: Without dead ends: 10199 [2024-11-06 19:39:51,903 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:51,904 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 148 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:51,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 305 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10199 states. [2024-11-06 19:39:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10199 to 10199. [2024-11-06 19:39:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 10198 states have (on average 1.1447342616199254) internal successors, (11674), 10198 states have internal predecessors, (11674), 0 states have call successors, (0), 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:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 11674 transitions. [2024-11-06 19:39:52,112 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 11674 transitions. Word has length 244 [2024-11-06 19:39:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:52,113 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 11674 transitions. [2024-11-06 19:39:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 11674 transitions. [2024-11-06 19:39:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-06 19:39:52,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:52,119 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:39:52,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:52,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash -162270422, now seen corresponding path program 1 times [2024-11-06 19:39:52,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:52,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769259357] [2024-11-06 19:39:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-06 19:39:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769259357] [2024-11-06 19:39:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769259357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929620734] [2024-11-06 19:39:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:52,301 INFO L87 Difference]: Start difference. First operand 10199 states and 11674 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:53,128 INFO L93 Difference]: Finished difference Result 22787 states and 26119 transitions. [2024-11-06 19:39:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 246 [2024-11-06 19:39:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:53,190 INFO L225 Difference]: With dead ends: 22787 [2024-11-06 19:39:53,190 INFO L226 Difference]: Without dead ends: 12590 [2024-11-06 19:39:53,197 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:53,198 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 166 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:53,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 370 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12590 states. [2024-11-06 19:39:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12590 to 10742. [2024-11-06 19:39:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10742 states, 10741 states have (on average 1.1390931943022065) internal successors, (12235), 10741 states have internal predecessors, (12235), 0 states have call successors, (0), 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:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10742 states to 10742 states and 12235 transitions. [2024-11-06 19:39:53,331 INFO L78 Accepts]: Start accepts. Automaton has 10742 states and 12235 transitions. Word has length 246 [2024-11-06 19:39:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:53,331 INFO L471 AbstractCegarLoop]: Abstraction has 10742 states and 12235 transitions. [2024-11-06 19:39:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 10742 states and 12235 transitions. [2024-11-06 19:39:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-06 19:39:53,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:53,337 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:39:53,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash 712794243, now seen corresponding path program 1 times [2024-11-06 19:39:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439079937] [2024-11-06 19:39:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-06 19:39:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439079937] [2024-11-06 19:39:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439079937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64015848] [2024-11-06 19:39:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:53,525 INFO L87 Difference]: Start difference. First operand 10742 states and 12235 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:54,274 INFO L93 Difference]: Finished difference Result 21669 states and 24664 transitions. [2024-11-06 19:39:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:54,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 251 [2024-11-06 19:39:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:54,298 INFO L225 Difference]: With dead ends: 21669 [2024-11-06 19:39:54,298 INFO L226 Difference]: Without dead ends: 10929 [2024-11-06 19:39:54,310 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:54,310 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 168 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:54,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 373 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10929 states. [2024-11-06 19:39:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10929 to 10741. [2024-11-06 19:39:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.1175046554934822) internal successors, (12002), 10740 states have internal predecessors, (12002), 0 states have call successors, (0), 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:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 12002 transitions. [2024-11-06 19:39:54,435 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 12002 transitions. Word has length 251 [2024-11-06 19:39:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 12002 transitions. [2024-11-06 19:39:54,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 12002 transitions. [2024-11-06 19:39:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-06 19:39:54,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:54,441 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:39:54,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:54,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1932798442, now seen corresponding path program 1 times [2024-11-06 19:39:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055987726] [2024-11-06 19:39:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 115 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055987726] [2024-11-06 19:39:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055987726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:39:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987225065] [2024-11-06 19:39:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:39:54,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:55,000 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:55,002 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:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:55,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:39:55,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:39:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:55,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:39:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987225065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:39:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:39:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453575836] [2024-11-06 19:39:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:39:55,754 INFO L87 Difference]: Start difference. First operand 10741 states and 12002 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:56,576 INFO L93 Difference]: Finished difference Result 21483 states and 24006 transitions. [2024-11-06 19:39:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2024-11-06 19:39:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:56,594 INFO L225 Difference]: With dead ends: 21483 [2024-11-06 19:39:56,595 INFO L226 Difference]: Without dead ends: 10744 [2024-11-06 19:39:56,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:39:56,604 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 187 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:56,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 155 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2024-11-06 19:39:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 10741. [2024-11-06 19:39:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.1163873370577282) internal successors, (11990), 10740 states have internal predecessors, (11990), 0 states have call successors, (0), 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:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 11990 transitions. [2024-11-06 19:39:56,724 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 11990 transitions. Word has length 265 [2024-11-06 19:39:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:56,724 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 11990 transitions. [2024-11-06 19:39:56,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 11990 transitions. [2024-11-06 19:39:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-06 19:39:56,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:56,731 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, 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, 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] [2024-11-06 19:39:56,749 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:56,935 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,SelfDestructingSolverStorable13 [2024-11-06 19:39:56,936 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 452894645, now seen corresponding path program 1 times [2024-11-06 19:39:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636211623] [2024-11-06 19:39:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-06 19:39:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636211623] [2024-11-06 19:39:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636211623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:57,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152442865] [2024-11-06 19:39:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:57,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:57,161 INFO L87 Difference]: Start difference. First operand 10741 states and 11990 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:57,714 INFO L93 Difference]: Finished difference Result 22768 states and 25423 transitions. [2024-11-06 19:39:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:57,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 299 [2024-11-06 19:39:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:57,727 INFO L225 Difference]: With dead ends: 22768 [2024-11-06 19:39:57,727 INFO L226 Difference]: Without dead ends: 12029 [2024-11-06 19:39:57,734 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:57,735 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 161 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:57,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12029 states. [2024-11-06 19:39:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12029 to 11477. [2024-11-06 19:39:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11477 states, 11476 states have (on average 1.1120599512025096) internal successors, (12762), 11476 states have internal predecessors, (12762), 0 states have call successors, (0), 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:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11477 states to 11477 states and 12762 transitions. [2024-11-06 19:39:57,843 INFO L78 Accepts]: Start accepts. Automaton has 11477 states and 12762 transitions. Word has length 299 [2024-11-06 19:39:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:57,844 INFO L471 AbstractCegarLoop]: Abstraction has 11477 states and 12762 transitions. [2024-11-06 19:39:57,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 11477 states and 12762 transitions. [2024-11-06 19:39:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-06 19:39:57,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:57,851 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, 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, 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] [2024-11-06 19:39:57,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:39:57,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:57,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -365523663, now seen corresponding path program 1 times [2024-11-06 19:39:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764541053] [2024-11-06 19:39:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:39:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764541053] [2024-11-06 19:39:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764541053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703765356] [2024-11-06 19:39:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:58,255 INFO L87 Difference]: Start difference. First operand 11477 states and 12762 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:59,368 INFO L93 Difference]: Finished difference Result 28510 states and 31713 transitions. [2024-11-06 19:39:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2024-11-06 19:39:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:59,390 INFO L225 Difference]: With dead ends: 28510 [2024-11-06 19:39:59,391 INFO L226 Difference]: Without dead ends: 16294 [2024-11-06 19:39:59,397 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:59,398 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 310 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 401 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:39:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16294 states. [2024-11-06 19:39:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16294 to 12966. [2024-11-06 19:39:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12966 states, 12965 states have (on average 1.112996529116853) internal successors, (14430), 12965 states have internal predecessors, (14430), 0 states have call successors, (0), 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:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12966 states to 12966 states and 14430 transitions. [2024-11-06 19:39:59,544 INFO L78 Accepts]: Start accepts. Automaton has 12966 states and 14430 transitions. Word has length 303 [2024-11-06 19:39:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 12966 states and 14430 transitions. [2024-11-06 19:39:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 12966 states and 14430 transitions. [2024-11-06 19:39:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-06 19:39:59,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:59,552 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, 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, 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] [2024-11-06 19:39:59,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:39:59,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:59,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2016302327, now seen corresponding path program 1 times [2024-11-06 19:39:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511289656] [2024-11-06 19:39:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:39:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511289656] [2024-11-06 19:39:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511289656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:59,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:59,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788683615] [2024-11-06 19:39:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:59,878 INFO L87 Difference]: Start difference. First operand 12966 states and 14430 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:01,067 INFO L93 Difference]: Finished difference Result 33322 states and 37039 transitions. [2024-11-06 19:40:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2024-11-06 19:40:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:01,095 INFO L225 Difference]: With dead ends: 33322 [2024-11-06 19:40:01,096 INFO L226 Difference]: Without dead ends: 20358 [2024-11-06 19:40:01,108 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:40:01,109 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 331 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:01,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 87 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:40:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2024-11-06 19:40:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 18691. [2024-11-06 19:40:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18691 states, 18690 states have (on average 1.1076511503477795) internal successors, (20702), 18690 states have internal predecessors, (20702), 0 states have call successors, (0), 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:40:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18691 states to 18691 states and 20702 transitions. [2024-11-06 19:40:01,333 INFO L78 Accepts]: Start accepts. Automaton has 18691 states and 20702 transitions. Word has length 319 [2024-11-06 19:40:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:01,334 INFO L471 AbstractCegarLoop]: Abstraction has 18691 states and 20702 transitions. [2024-11-06 19:40:01,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18691 states and 20702 transitions. [2024-11-06 19:40:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-06 19:40:01,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:01,341 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, 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, 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] [2024-11-06 19:40:01,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:40:01,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1832513992, now seen corresponding path program 1 times [2024-11-06 19:40:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:01,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793710870] [2024-11-06 19:40:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-06 19:40:01,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793710870] [2024-11-06 19:40:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793710870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:01,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:01,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496780165] [2024-11-06 19:40:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:01,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:01,487 INFO L87 Difference]: Start difference. First operand 18691 states and 20702 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:40:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:02,153 INFO L93 Difference]: Finished difference Result 39587 states and 43861 transitions. [2024-11-06 19:40:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 328 [2024-11-06 19:40:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:02,175 INFO L225 Difference]: With dead ends: 39587 [2024-11-06 19:40:02,175 INFO L226 Difference]: Without dead ends: 20898 [2024-11-06 19:40:02,189 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:40:02,190 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 189 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:02,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 144 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:40:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2024-11-06 19:40:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 19058. [2024-11-06 19:40:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19058 states, 19057 states have (on average 1.108306658970457) internal successors, (21121), 19057 states have internal predecessors, (21121), 0 states have call successors, (0), 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:40:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19058 states to 19058 states and 21121 transitions. [2024-11-06 19:40:02,409 INFO L78 Accepts]: Start accepts. Automaton has 19058 states and 21121 transitions. Word has length 328 [2024-11-06 19:40:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:02,410 INFO L471 AbstractCegarLoop]: Abstraction has 19058 states and 21121 transitions. [2024-11-06 19:40:02,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:40:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19058 states and 21121 transitions. [2024-11-06 19:40:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-06 19:40:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:02,415 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:40:02,415 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:02,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1937622691, now seen corresponding path program 1 times [2024-11-06 19:40:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942342915] [2024-11-06 19:40:02,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942342915] [2024-11-06 19:40:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942342915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075674153] [2024-11-06 19:40:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:02,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:02,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:40:02,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:40:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:02,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:40:02,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:03,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:40:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075674153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:40:04,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:40:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-11-06 19:40:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709568640] [2024-11-06 19:40:04,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:40:04,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 19:40:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 19:40:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:40:04,986 INFO L87 Difference]: Start difference. First operand 19058 states and 21121 transitions. Second operand has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 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:40:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:07,835 INFO L93 Difference]: Finished difference Result 39528 states and 43604 transitions. [2024-11-06 19:40:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 19:40:07,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 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 330 [2024-11-06 19:40:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:07,878 INFO L225 Difference]: With dead ends: 39528 [2024-11-06 19:40:07,878 INFO L226 Difference]: Without dead ends: 39526 [2024-11-06 19:40:07,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:40:07,886 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1218 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:07,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 180 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:40:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39526 states. [2024-11-06 19:40:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39526 to 20355. [2024-11-06 19:40:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20354 states have (on average 1.1096099046870394) internal successors, (22585), 20354 states have internal predecessors, (22585), 0 states have call successors, (0), 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:40:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 22585 transitions. [2024-11-06 19:40:08,292 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 22585 transitions. Word has length 330 [2024-11-06 19:40:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:08,293 INFO L471 AbstractCegarLoop]: Abstraction has 20355 states and 22585 transitions. [2024-11-06 19:40:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 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:40:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 22585 transitions. [2024-11-06 19:40:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-06 19:40:08,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:08,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, 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, 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] [2024-11-06 19:40:08,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:40:08,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:08,504 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1221918338, now seen corresponding path program 1 times [2024-11-06 19:40:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:08,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150467492] [2024-11-06 19:40:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-06 19:40:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150467492] [2024-11-06 19:40:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150467492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:40:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243565475] [2024-11-06 19:40:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:08,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:08,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:08,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:08,807 INFO L87 Difference]: Start difference. First operand 20355 states and 22585 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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:40:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:09,638 INFO L93 Difference]: Finished difference Result 44035 states and 48691 transitions. [2024-11-06 19:40:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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 354 [2024-11-06 19:40:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:09,660 INFO L225 Difference]: With dead ends: 44035 [2024-11-06 19:40:09,660 INFO L226 Difference]: Without dead ends: 23682 [2024-11-06 19:40:09,672 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:40:09,672 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 328 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:09,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 59 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2024-11-06 19:40:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 19798. [2024-11-06 19:40:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19798 states, 19797 states have (on average 1.1063292418043138) internal successors, (21902), 19797 states have internal predecessors, (21902), 0 states have call successors, (0), 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:40:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19798 states to 19798 states and 21902 transitions. [2024-11-06 19:40:09,872 INFO L78 Accepts]: Start accepts. Automaton has 19798 states and 21902 transitions. Word has length 354 [2024-11-06 19:40:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:09,872 INFO L471 AbstractCegarLoop]: Abstraction has 19798 states and 21902 transitions. [2024-11-06 19:40:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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:40:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19798 states and 21902 transitions. [2024-11-06 19:40:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-11-06 19:40:09,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:09,887 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:09,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 19:40:09,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:09,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1537772616, now seen corresponding path program 1 times [2024-11-06 19:40:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938632421] [2024-11-06 19:40:09,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 19:40:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938632421] [2024-11-06 19:40:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938632421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878836766] [2024-11-06 19:40:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:10,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:10,432 INFO L87 Difference]: Start difference. First operand 19798 states and 21902 transitions. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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:40:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:11,484 INFO L93 Difference]: Finished difference Result 45494 states and 50367 transitions. [2024-11-06 19:40:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 518 [2024-11-06 19:40:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:11,517 INFO L225 Difference]: With dead ends: 45494 [2024-11-06 19:40:11,518 INFO L226 Difference]: Without dead ends: 25698 [2024-11-06 19:40:11,530 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:40:11,531 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:11,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 87 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:40:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2024-11-06 19:40:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 22932. [2024-11-06 19:40:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22932 states, 22931 states have (on average 1.1051415114909948) internal successors, (25342), 22931 states have internal predecessors, (25342), 0 states have call successors, (0), 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:40:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22932 states to 22932 states and 25342 transitions. [2024-11-06 19:40:11,773 INFO L78 Accepts]: Start accepts. Automaton has 22932 states and 25342 transitions. Word has length 518 [2024-11-06 19:40:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 22932 states and 25342 transitions. [2024-11-06 19:40:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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:40:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 22932 states and 25342 transitions. [2024-11-06 19:40:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-06 19:40:11,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:11,791 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:40:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 19:40:11,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash 586961002, now seen corresponding path program 1 times [2024-11-06 19:40:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117217778] [2024-11-06 19:40:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:40:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117217778] [2024-11-06 19:40:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117217778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990540328] [2024-11-06 19:40:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:12,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:12,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:12,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:40:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:40:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:12,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 19:40:12,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:40:13,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:40:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:40:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990540328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:40:19,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:40:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2024-11-06 19:40:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816066551] [2024-11-06 19:40:19,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:40:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 19:40:19,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:19,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 19:40:19,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-06 19:40:19,047 INFO L87 Difference]: Start difference. First operand 22932 states and 25342 transitions. Second operand has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 0 states have call successors, (0), 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:40:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:23,559 INFO L93 Difference]: Finished difference Result 89363 states and 98551 transitions. [2024-11-06 19:40:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 19:40:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 0 states have call successors, (0), 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 556 [2024-11-06 19:40:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:23,637 INFO L225 Difference]: With dead ends: 89363 [2024-11-06 19:40:23,637 INFO L226 Difference]: Without dead ends: 66801 [2024-11-06 19:40:23,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-11-06 19:40:23,666 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1762 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 5153 mSolverCounterSat, 1396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1396 IncrementalHoareTripleChecker+Valid, 5153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:23,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 288 Invalid, 6549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1396 Valid, 5153 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-06 19:40:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66801 states. [2024-11-06 19:40:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66801 to 39509. [2024-11-06 19:40:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39509 states, 39508 states have (on average 1.1031436671053965) internal successors, (43583), 39508 states have internal predecessors, (43583), 0 states have call successors, (0), 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:40:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39509 states to 39509 states and 43583 transitions. [2024-11-06 19:40:24,429 INFO L78 Accepts]: Start accepts. Automaton has 39509 states and 43583 transitions. Word has length 556 [2024-11-06 19:40:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:24,430 INFO L471 AbstractCegarLoop]: Abstraction has 39509 states and 43583 transitions. [2024-11-06 19:40:24,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 0 states have call successors, (0), 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:40:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39509 states and 43583 transitions. [2024-11-06 19:40:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-11-06 19:40:24,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:24,456 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, 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, 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, 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:40:24,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 19:40:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:24,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2055741485, now seen corresponding path program 1 times [2024-11-06 19:40:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526850518] [2024-11-06 19:40:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-06 19:40:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526850518] [2024-11-06 19:40:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526850518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:24,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721940605] [2024-11-06 19:40:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:24,945 INFO L87 Difference]: Start difference. First operand 39509 states and 43583 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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:40:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:26,041 INFO L93 Difference]: Finished difference Result 83259 states and 91877 transitions. [2024-11-06 19:40:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:26,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 619 [2024-11-06 19:40:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:26,096 INFO L225 Difference]: With dead ends: 83259 [2024-11-06 19:40:26,096 INFO L226 Difference]: Without dead ends: 46884 [2024-11-06 19:40:26,120 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:40:26,120 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 174 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:26,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:40:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46884 states. [2024-11-06 19:40:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46884 to 44115. [2024-11-06 19:40:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44115 states, 44114 states have (on average 1.1028698372398784) internal successors, (48652), 44114 states have internal predecessors, (48652), 0 states have call successors, (0), 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:40:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44115 states to 44115 states and 48652 transitions. [2024-11-06 19:40:26,605 INFO L78 Accepts]: Start accepts. Automaton has 44115 states and 48652 transitions. Word has length 619 [2024-11-06 19:40:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:26,606 INFO L471 AbstractCegarLoop]: Abstraction has 44115 states and 48652 transitions. [2024-11-06 19:40:26,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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:40:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44115 states and 48652 transitions. [2024-11-06 19:40:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2024-11-06 19:40:26,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:26,637 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:40:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 19:40:26,637 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1321919940, now seen corresponding path program 1 times [2024-11-06 19:40:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642318154] [2024-11-06 19:40:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1125 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-06 19:40:26,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:26,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642318154] [2024-11-06 19:40:26,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642318154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:26,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336924413] [2024-11-06 19:40:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:26,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:26,987 INFO L87 Difference]: Start difference. First operand 44115 states and 48652 transitions. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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:40:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:27,672 INFO L93 Difference]: Finished difference Result 90433 states and 99685 transitions. [2024-11-06 19:40:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 778 [2024-11-06 19:40:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:27,724 INFO L225 Difference]: With dead ends: 90433 [2024-11-06 19:40:27,724 INFO L226 Difference]: Without dead ends: 46688 [2024-11-06 19:40:27,752 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:40:27,753 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 76 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:27,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 141 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:40:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46688 states. [2024-11-06 19:40:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46688 to 43555. [2024-11-06 19:40:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43555 states, 43554 states have (on average 1.100656656105065) internal successors, (47938), 43554 states have internal predecessors, (47938), 0 states have call successors, (0), 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:40:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43555 states to 43555 states and 47938 transitions. [2024-11-06 19:40:28,209 INFO L78 Accepts]: Start accepts. Automaton has 43555 states and 47938 transitions. Word has length 778 [2024-11-06 19:40:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:28,209 INFO L471 AbstractCegarLoop]: Abstraction has 43555 states and 47938 transitions. [2024-11-06 19:40:28,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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:40:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43555 states and 47938 transitions. [2024-11-06 19:40:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2024-11-06 19:40:28,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:28,242 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:28,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-06 19:40:28,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1130349340, now seen corresponding path program 1 times [2024-11-06 19:40:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219674271] [2024-11-06 19:40:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1889 backedges. 1356 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2024-11-06 19:40:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219674271] [2024-11-06 19:40:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219674271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662316431] [2024-11-06 19:40:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:28,667 INFO L87 Difference]: Start difference. First operand 43555 states and 47938 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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:40:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:29,314 INFO L93 Difference]: Finished difference Result 86409 states and 95036 transitions. [2024-11-06 19:40:29,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 825 [2024-11-06 19:40:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:29,357 INFO L225 Difference]: With dead ends: 86409 [2024-11-06 19:40:29,357 INFO L226 Difference]: Without dead ends: 44884 [2024-11-06 19:40:29,379 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:40:29,379 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:29,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:40:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44884 states. [2024-11-06 19:40:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44884 to 40977. [2024-11-06 19:40:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40977 states, 40976 states have (on average 1.092078289730574) internal successors, (44749), 40976 states have internal predecessors, (44749), 0 states have call successors, (0), 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:40:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40977 states to 40977 states and 44749 transitions. [2024-11-06 19:40:29,977 INFO L78 Accepts]: Start accepts. Automaton has 40977 states and 44749 transitions. Word has length 825 [2024-11-06 19:40:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:29,977 INFO L471 AbstractCegarLoop]: Abstraction has 40977 states and 44749 transitions. [2024-11-06 19:40:29,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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:40:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40977 states and 44749 transitions. [2024-11-06 19:40:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2024-11-06 19:40:30,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:30,013 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-06 19:40:30,013 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:30,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 809567982, now seen corresponding path program 1 times [2024-11-06 19:40:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173196287] [2024-11-06 19:40:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 1348 proven. 0 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-11-06 19:40:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173196287] [2024-11-06 19:40:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173196287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045976760] [2024-11-06 19:40:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:30,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:30,656 INFO L87 Difference]: Start difference. First operand 40977 states and 44749 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:40:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:31,344 INFO L93 Difference]: Finished difference Result 72185 states and 78810 transitions. [2024-11-06 19:40:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 858 [2024-11-06 19:40:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:31,377 INFO L225 Difference]: With dead ends: 72185 [2024-11-06 19:40:31,377 INFO L226 Difference]: Without dead ends: 31578 [2024-11-06 19:40:31,400 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:40:31,401 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 74 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:31,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 339 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:40:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31578 states. [2024-11-06 19:40:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31578 to 29544. [2024-11-06 19:40:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29544 states, 29543 states have (on average 1.0833023051145787) internal successors, (32004), 29543 states have internal predecessors, (32004), 0 states have call successors, (0), 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:40:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29544 states to 29544 states and 32004 transitions. [2024-11-06 19:40:31,717 INFO L78 Accepts]: Start accepts. Automaton has 29544 states and 32004 transitions. Word has length 858 [2024-11-06 19:40:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:31,717 INFO L471 AbstractCegarLoop]: Abstraction has 29544 states and 32004 transitions. [2024-11-06 19:40:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:40:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29544 states and 32004 transitions. [2024-11-06 19:40:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2024-11-06 19:40:31,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:31,743 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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:40:31,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-06 19:40:31,743 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -848895741, now seen corresponding path program 1 times [2024-11-06 19:40:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292593205] [2024-11-06 19:40:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1568 proven. 511 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-06 19:40:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292593205] [2024-11-06 19:40:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292593205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506536305] [2024-11-06 19:40:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:33,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:33,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:40:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 19:40:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:33,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:40:33,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-06 19:40:33,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:40:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506536305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:40:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-06 19:40:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98391672] [2024-11-06 19:40:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-06 19:40:33,625 INFO L87 Difference]: Start difference. First operand 29544 states and 32004 transitions. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:40:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:34,700 INFO L93 Difference]: Finished difference Result 63882 states and 69329 transitions. [2024-11-06 19:40:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:34,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 884 [2024-11-06 19:40:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:34,732 INFO L225 Difference]: With dead ends: 63882 [2024-11-06 19:40:34,732 INFO L226 Difference]: Without dead ends: 34708 [2024-11-06 19:40:34,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-06 19:40:34,745 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 231 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:34,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 105 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:40:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34708 states. [2024-11-06 19:40:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34708 to 31757. [2024-11-06 19:40:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31757 states, 31756 states have (on average 1.0782214384683209) internal successors, (34240), 31756 states have internal predecessors, (34240), 0 states have call successors, (0), 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:40:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31757 states to 31757 states and 34240 transitions. [2024-11-06 19:40:35,116 INFO L78 Accepts]: Start accepts. Automaton has 31757 states and 34240 transitions. Word has length 884 [2024-11-06 19:40:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:35,116 INFO L471 AbstractCegarLoop]: Abstraction has 31757 states and 34240 transitions. [2024-11-06 19:40:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:40:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31757 states and 34240 transitions. [2024-11-06 19:40:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2024-11-06 19:40:35,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:35,140 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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, 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:40:35,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 19:40:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-06 19:40:35,341 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1404955904, now seen corresponding path program 1 times [2024-11-06 19:40:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:35,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096082843] [2024-11-06 19:40:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 1995 proven. 508 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-06 19:40:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096082843] [2024-11-06 19:40:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096082843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389653034] [2024-11-06 19:40:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:37,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:37,242 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:37,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 19:40:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:37,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:40:37,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 1929 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2024-11-06 19:40:37,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:40:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389653034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:37,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:40:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-06 19:40:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865004365] [2024-11-06 19:40:37,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:37,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:40:37,669 INFO L87 Difference]: Start difference. First operand 31757 states and 34240 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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:40:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:38,338 INFO L93 Difference]: Finished difference Result 70140 states and 75614 transitions. [2024-11-06 19:40:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 961 [2024-11-06 19:40:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:38,379 INFO L225 Difference]: With dead ends: 70140 [2024-11-06 19:40:38,379 INFO L226 Difference]: Without dead ends: 38753 [2024-11-06 19:40:38,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:40:38,402 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:38,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 321 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:40:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38753 states. [2024-11-06 19:40:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38753 to 31574. [2024-11-06 19:40:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31574 states, 31573 states have (on average 1.0764260602413454) internal successors, (33986), 31573 states have internal predecessors, (33986), 0 states have call successors, (0), 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:40:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31574 states to 31574 states and 33986 transitions. [2024-11-06 19:40:38,764 INFO L78 Accepts]: Start accepts. Automaton has 31574 states and 33986 transitions. Word has length 961 [2024-11-06 19:40:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:38,765 INFO L471 AbstractCegarLoop]: Abstraction has 31574 states and 33986 transitions. [2024-11-06 19:40:38,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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:40:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 31574 states and 33986 transitions. [2024-11-06 19:40:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2024-11-06 19:40:38,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:38,794 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2024-11-06 19:40:38,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 19:40:38,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-06 19:40:38,994 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:38,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 823028626, now seen corresponding path program 1 times [2024-11-06 19:40:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607705972] [2024-11-06 19:40:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2616 backedges. 1762 proven. 184 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-11-06 19:40:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607705972] [2024-11-06 19:40:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607705972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467094536] [2024-11-06 19:40:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:40,799 INFO L229 MonitoredProcess]: Starting monitored process 7 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:40:40,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 19:40:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:41,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:40:41,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2616 backedges. 1631 proven. 434 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-06 19:40:41,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:40:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2616 backedges. 2065 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-06 19:40:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467094536] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:40:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 13 [2024-11-06 19:40:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66255878] [2024-11-06 19:40:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 19:40:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 19:40:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-06 19:40:42,050 INFO L87 Difference]: Start difference. First operand 31574 states and 33986 transitions. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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:40:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:43,078 INFO L93 Difference]: Finished difference Result 68674 states and 73993 transitions. [2024-11-06 19:40:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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 967 [2024-11-06 19:40:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:43,115 INFO L225 Difference]: With dead ends: 68674 [2024-11-06 19:40:43,115 INFO L226 Difference]: Without dead ends: 39310 [2024-11-06 19:40:43,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1940 GetRequests, 1928 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-06 19:40:43,135 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 273 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:43,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 63 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:40:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39310 states. [2024-11-06 19:40:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39310 to 37468. [2024-11-06 19:40:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37468 states, 37467 states have (on average 1.0766274321402836) internal successors, (40338), 37467 states have internal predecessors, (40338), 0 states have call successors, (0), 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:40:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37468 states to 37468 states and 40338 transitions. [2024-11-06 19:40:43,506 INFO L78 Accepts]: Start accepts. Automaton has 37468 states and 40338 transitions. Word has length 967 [2024-11-06 19:40:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:43,506 INFO L471 AbstractCegarLoop]: Abstraction has 37468 states and 40338 transitions. [2024-11-06 19:40:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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:40:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37468 states and 40338 transitions. [2024-11-06 19:40:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2024-11-06 19:40:43,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:43,534 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 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:40:43,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-06 19:40:43,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-06 19:40:43,734 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:43,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1077420330, now seen corresponding path program 1 times [2024-11-06 19:40:43,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:43,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580387203] [2024-11-06 19:40:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 2280 proven. 735 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2024-11-06 19:40:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580387203] [2024-11-06 19:40:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580387203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104641021] [2024-11-06 19:40:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:45,170 INFO L229 MonitoredProcess]: Starting monitored process 8 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:40:45,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 19:40:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:45,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:40:45,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 2070 proven. 222 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2024-11-06 19:40:46,018 INFO L311 TraceCheckSpWp]: Computing backward predicates...