./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label41.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/Problem12_label41.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', 'fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557'] 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/Problem12_label41.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 fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:44:01,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:44:02,074 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:44:02,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:44:02,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:44:02,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:44:02,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:44:02,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:44:02,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:44:02,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:44:02,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:44:02,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:44:02,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:44:02,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:44:02,114 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:44:02,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:44:02,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:44:02,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:44:02,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:44:02,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:44:02,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:44:02,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:44:02,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:44:02,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:44:02,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:44:02,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:44:02,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:44:02,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:44:02,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:44:02,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:44:02,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:44:02,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:44:02,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:44:02,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:44:02,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:44:02,118 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 -> fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 [2024-11-06 19:44:02,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:44:02,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:44:02,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:44:02,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:44:02,401 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:44:02,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2024-11-06 19:44:03,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:44:04,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:44:04,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2024-11-06 19:44:04,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/945b54306/79b0f03221c946558957341cd2ea5c2b/FLAG341783c08 [2024-11-06 19:44:04,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/945b54306/79b0f03221c946558957341cd2ea5c2b [2024-11-06 19:44:04,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:44:04,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:44:04,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:44:04,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:44:04,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:44:04,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:44:04" (1/1) ... [2024-11-06 19:44:04,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f170f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:04, skipping insertion in model container [2024-11-06 19:44:04,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:44:04" (1/1) ... [2024-11-06 19:44:04,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:44:04,627 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/Problem12_label41.c[6479,6492] [2024-11-06 19:44:05,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:44:05,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:44:05,228 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/Problem12_label41.c[6479,6492] [2024-11-06 19:44:05,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:44:05,559 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:44:05,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05 WrapperNode [2024-11-06 19:44:05,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:44:05,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:44:05,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:44:05,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:44:05,566 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:44:05" (1/1) ... [2024-11-06 19:44:05,645 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:44:05" (1/1) ... [2024-11-06 19:44:06,072 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:44:06,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:44:06,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:44:06,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:44:06,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:44:06,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,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:44:06,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:44:06,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:44:06,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:44:06,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:44:06,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (1/1) ... [2024-11-06 19:44:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:44:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:06,745 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:44:06,751 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:44:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:44:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:44:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:44:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:44:06,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:44:06,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:44:11,118 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:44:11,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:44:11,169 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:44:11,169 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:44:11,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:44:11 BoogieIcfgContainer [2024-11-06 19:44:11,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:44:11,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:44:11,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:44:11,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:44:11,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:44:04" (1/3) ... [2024-11-06 19:44:11,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c1d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:44:11, skipping insertion in model container [2024-11-06 19:44:11,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:05" (2/3) ... [2024-11-06 19:44:11,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c1d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:44:11, skipping insertion in model container [2024-11-06 19:44:11,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:44:11" (3/3) ... [2024-11-06 19:44:11,184 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label41.c [2024-11-06 19:44:11,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:44:11,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:44:11,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:44:11,303 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;@31c423cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:44:11,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:44:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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:44:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 19:44:11,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:11,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:44:11,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:11,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2024-11-06 19:44:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244075613] [2024-11-06 19:44:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:11,698 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:44:11,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:11,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244075613] [2024-11-06 19:44:11,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244075613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:11,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:44:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814693417] [2024-11-06 19:44:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:11,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:11,730 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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:44:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:15,129 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2024-11-06 19:44:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:15,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-06 19:44:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:15,146 INFO L225 Difference]: With dead ends: 2388 [2024-11-06 19:44:15,146 INFO L226 Difference]: Without dead ends: 1506 [2024-11-06 19:44:15,151 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:44:15,154 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 782 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:15,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-06 19:44:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-06 19:44:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-06 19:44:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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:44:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2024-11-06 19:44:15,258 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 52 [2024-11-06 19:44:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:15,258 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2024-11-06 19:44:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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:44:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2024-11-06 19:44:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 19:44:15,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:15,264 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, 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] [2024-11-06 19:44:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:44:15,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1969596239, now seen corresponding path program 1 times [2024-11-06 19:44:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:15,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125107895] [2024-11-06 19:44:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125107895] [2024-11-06 19:44:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125107895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700696523] [2024-11-06 19:44:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:44:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:44:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:44:15,809 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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:44:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:19,416 INFO L93 Difference]: Finished difference Result 4549 states and 7430 transitions. [2024-11-06 19:44:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:44:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-06 19:44:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:19,429 INFO L225 Difference]: With dead ends: 4549 [2024-11-06 19:44:19,429 INFO L226 Difference]: Without dead ends: 3008 [2024-11-06 19:44:19,434 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:44:19,436 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 703 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:19,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 652 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3074 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:44:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2024-11-06 19:44:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2024-11-06 19:44:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.341536415031593) internal successors, (4034), 3007 states have internal predecessors, (4034), 0 states have call successors, (0), 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:44:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4034 transitions. [2024-11-06 19:44:19,494 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4034 transitions. Word has length 123 [2024-11-06 19:44:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:19,494 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4034 transitions. [2024-11-06 19:44:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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:44:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4034 transitions. [2024-11-06 19:44:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-06 19:44:19,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:19,498 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, 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] [2024-11-06 19:44:19,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:44:19,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1310463314, now seen corresponding path program 1 times [2024-11-06 19:44:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570655946] [2024-11-06 19:44:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570655946] [2024-11-06 19:44:19,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570655946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:19,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959381220] [2024-11-06 19:44:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:19,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:44:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:44:19,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:44:19,923 INFO L87 Difference]: Start difference. First operand 3008 states and 4034 transitions. Second operand has 4 states, 4 states have (on average 40.25) 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:44:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:23,721 INFO L93 Difference]: Finished difference Result 9769 states and 12892 transitions. [2024-11-06 19:44:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:44:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) 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 161 [2024-11-06 19:44:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:23,757 INFO L225 Difference]: With dead ends: 9769 [2024-11-06 19:44:23,757 INFO L226 Difference]: Without dead ends: 6763 [2024-11-06 19:44:23,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:44:23,763 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 2093 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:23,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 452 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 19:44:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-06 19:44:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2024-11-06 19:44:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.287341023365868) internal successors, (8705), 6762 states have internal predecessors, (8705), 0 states have call successors, (0), 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:44:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8705 transitions. [2024-11-06 19:44:23,933 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8705 transitions. Word has length 161 [2024-11-06 19:44:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8705 transitions. [2024-11-06 19:44:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) 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:44:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8705 transitions. [2024-11-06 19:44:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-06 19:44:23,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:23,942 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:23,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:44:23,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:23,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1590426961, now seen corresponding path program 1 times [2024-11-06 19:44:23,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:23,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191601124] [2024-11-06 19:44:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:44:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191601124] [2024-11-06 19:44:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191601124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732301573] [2024-11-06 19:44:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:44:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:44:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:44:24,392 INFO L87 Difference]: Start difference. First operand 6763 states and 8705 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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:44:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:27,448 INFO L93 Difference]: Finished difference Result 15816 states and 21393 transitions. [2024-11-06 19:44:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:44:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 264 [2024-11-06 19:44:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:27,470 INFO L225 Difference]: With dead ends: 15816 [2024-11-06 19:44:27,470 INFO L226 Difference]: Without dead ends: 9769 [2024-11-06 19:44:27,478 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:44:27,479 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:27,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 492 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:44:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2024-11-06 19:44:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9767. [2024-11-06 19:44:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.272987917263977) internal successors, (12432), 9766 states have internal predecessors, (12432), 0 states have call successors, (0), 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:44:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12432 transitions. [2024-11-06 19:44:27,652 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12432 transitions. Word has length 264 [2024-11-06 19:44:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:27,653 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12432 transitions. [2024-11-06 19:44:27,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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:44:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12432 transitions. [2024-11-06 19:44:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-06 19:44:27,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:27,659 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:44:27,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -36677128, now seen corresponding path program 1 times [2024-11-06 19:44:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068016665] [2024-11-06 19:44:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 41 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068016665] [2024-11-06 19:44:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068016665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:44:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080736412] [2024-11-06 19:44:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:28,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:28,500 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:44:28,502 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:44:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:28,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:44:28,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:44:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:44:28,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:44:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080736412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:28,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:44:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-06 19:44:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392680284] [2024-11-06 19:44:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:28,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:44:28,755 INFO L87 Difference]: Start difference. First operand 9767 states and 12432 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:31,452 INFO L93 Difference]: Finished difference Result 24789 states and 32538 transitions. [2024-11-06 19:44:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2024-11-06 19:44:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:31,484 INFO L225 Difference]: With dead ends: 24789 [2024-11-06 19:44:31,485 INFO L226 Difference]: Without dead ends: 15775 [2024-11-06 19:44:31,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:44:31,491 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:31,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 574 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:44:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2024-11-06 19:44:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2024-11-06 19:44:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2571953848104476) internal successors, (19831), 15774 states have internal predecessors, (19831), 0 states have call successors, (0), 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:44:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19831 transitions. [2024-11-06 19:44:31,720 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19831 transitions. Word has length 282 [2024-11-06 19:44:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:31,722 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19831 transitions. [2024-11-06 19:44:31,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19831 transitions. [2024-11-06 19:44:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-06 19:44:31,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:31,731 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:31,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:44:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:31,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 591381476, now seen corresponding path program 1 times [2024-11-06 19:44:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196574597] [2024-11-06 19:44:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-06 19:44:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:32,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196574597] [2024-11-06 19:44:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196574597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:32,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:44:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55785298] [2024-11-06 19:44:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:32,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:32,265 INFO L87 Difference]: Start difference. First operand 15775 states and 19831 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:34,902 INFO L93 Difference]: Finished difference Result 44315 states and 56348 transitions. [2024-11-06 19:44:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-11-06 19:44:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:34,965 INFO L225 Difference]: With dead ends: 44315 [2024-11-06 19:44:34,966 INFO L226 Difference]: Without dead ends: 29293 [2024-11-06 19:44:34,979 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:44:34,981 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:34,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 422 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:44:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29293 states. [2024-11-06 19:44:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 26289. [2024-11-06 19:44:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26289 states, 26288 states have (on average 1.1972382836275106) internal successors, (31473), 26288 states have internal predecessors, (31473), 0 states have call successors, (0), 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:44:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26289 states to 26289 states and 31473 transitions. [2024-11-06 19:44:35,319 INFO L78 Accepts]: Start accepts. Automaton has 26289 states and 31473 transitions. Word has length 290 [2024-11-06 19:44:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 26289 states and 31473 transitions. [2024-11-06 19:44:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26289 states and 31473 transitions. [2024-11-06 19:44:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-06 19:44:35,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:35,330 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:35,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:44:35,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:35,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1453377430, now seen corresponding path program 1 times [2024-11-06 19:44:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963872424] [2024-11-06 19:44:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 19:44:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:35,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963872424] [2024-11-06 19:44:35,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963872424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:35,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645443047] [2024-11-06 19:44:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:35,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:35,755 INFO L87 Difference]: Start difference. First operand 26289 states and 31473 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:44:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:38,486 INFO L93 Difference]: Finished difference Result 65343 states and 79632 transitions. [2024-11-06 19:44:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 403 [2024-11-06 19:44:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:38,555 INFO L225 Difference]: With dead ends: 65343 [2024-11-06 19:44:38,555 INFO L226 Difference]: Without dead ends: 39807 [2024-11-06 19:44:38,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:38,579 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 679 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:38,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1247 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:44:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39807 states. [2024-11-06 19:44:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39807 to 37554. [2024-11-06 19:44:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37554 states, 37553 states have (on average 1.1675764918914602) internal successors, (43846), 37553 states have internal predecessors, (43846), 0 states have call successors, (0), 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:44:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37554 states to 37554 states and 43846 transitions. [2024-11-06 19:44:39,126 INFO L78 Accepts]: Start accepts. Automaton has 37554 states and 43846 transitions. Word has length 403 [2024-11-06 19:44:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:39,126 INFO L471 AbstractCegarLoop]: Abstraction has 37554 states and 43846 transitions. [2024-11-06 19:44:39,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:44:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37554 states and 43846 transitions. [2024-11-06 19:44:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-06 19:44:39,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:39,135 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:44:39,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 570079028, now seen corresponding path program 1 times [2024-11-06 19:44:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938856324] [2024-11-06 19:44:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:44:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938856324] [2024-11-06 19:44:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938856324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934537734] [2024-11-06 19:44:39,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:39,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:39,588 INFO L87 Difference]: Start difference. First operand 37554 states and 43846 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:44:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:42,744 INFO L93 Difference]: Finished difference Result 88624 states and 105173 transitions. [2024-11-06 19:44:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 407 [2024-11-06 19:44:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:42,807 INFO L225 Difference]: With dead ends: 88624 [2024-11-06 19:44:42,808 INFO L226 Difference]: Without dead ends: 51823 [2024-11-06 19:44:42,828 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:44:42,829 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 779 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:42,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 123 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:44:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51823 states. [2024-11-06 19:44:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51823 to 51823. [2024-11-06 19:44:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51823 states, 51822 states have (on average 1.1838215429740264) internal successors, (61348), 51822 states have internal predecessors, (61348), 0 states have call successors, (0), 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:44:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51823 states to 51823 states and 61348 transitions. [2024-11-06 19:44:43,433 INFO L78 Accepts]: Start accepts. Automaton has 51823 states and 61348 transitions. Word has length 407 [2024-11-06 19:44:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:43,434 INFO L471 AbstractCegarLoop]: Abstraction has 51823 states and 61348 transitions. [2024-11-06 19:44:43,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:44:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51823 states and 61348 transitions. [2024-11-06 19:44:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-06 19:44:43,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:43,443 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, 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, 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] [2024-11-06 19:44:43,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:44:43,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:43,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1281565654, now seen corresponding path program 1 times [2024-11-06 19:44:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:43,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461123972] [2024-11-06 19:44:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-06 19:44:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461123972] [2024-11-06 19:44:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461123972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406348255] [2024-11-06 19:44:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:44,088 INFO L87 Difference]: Start difference. First operand 51823 states and 61348 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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:44:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:46,510 INFO L93 Difference]: Finished difference Result 112656 states and 132797 transitions. [2024-11-06 19:44:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:46,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 411 [2024-11-06 19:44:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:46,578 INFO L225 Difference]: With dead ends: 112656 [2024-11-06 19:44:46,578 INFO L226 Difference]: Without dead ends: 61586 [2024-11-06 19:44:46,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:44:46,607 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 816 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:46,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 900 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:44:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2024-11-06 19:44:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 57831. [2024-11-06 19:44:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57831 states, 57830 states have (on average 1.147362960401176) internal successors, (66352), 57830 states have internal predecessors, (66352), 0 states have call successors, (0), 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:44:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57831 states to 57831 states and 66352 transitions. [2024-11-06 19:44:47,613 INFO L78 Accepts]: Start accepts. Automaton has 57831 states and 66352 transitions. Word has length 411 [2024-11-06 19:44:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 57831 states and 66352 transitions. [2024-11-06 19:44:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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:44:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 57831 states and 66352 transitions. [2024-11-06 19:44:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-06 19:44:47,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:47,639 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:44:47,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:44:47,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1151737346, now seen corresponding path program 1 times [2024-11-06 19:44:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:47,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64334652] [2024-11-06 19:44:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 350 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64334652] [2024-11-06 19:44:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64334652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:44:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935348445] [2024-11-06 19:44:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:48,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:48,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:48,655 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:44:48,656 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:44:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:48,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:44:48,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:44:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-06 19:44:48,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:44:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935348445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:44:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 19:44:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437779399] [2024-11-06 19:44:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:44:48,958 INFO L87 Difference]: Start difference. First operand 57831 states and 66352 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:44:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:51,803 INFO L93 Difference]: Finished difference Result 119415 states and 136613 transitions. [2024-11-06 19:44:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:51,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 470 [2024-11-06 19:44:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:51,864 INFO L225 Difference]: With dead ends: 119415 [2024-11-06 19:44:51,865 INFO L226 Difference]: Without dead ends: 62337 [2024-11-06 19:44:51,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:44:51,895 INFO L432 NwaCegarLoop]: 1203 mSDtfsCounter, 705 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:51,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1210 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:44:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62337 states. [2024-11-06 19:44:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 61586. [2024-11-06 19:44:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61586 states, 61585 states have (on average 1.1196070471705772) internal successors, (68951), 61585 states have internal predecessors, (68951), 0 states have call successors, (0), 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:44:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61586 states to 61586 states and 68951 transitions. [2024-11-06 19:44:52,527 INFO L78 Accepts]: Start accepts. Automaton has 61586 states and 68951 transitions. Word has length 470 [2024-11-06 19:44:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:52,528 INFO L471 AbstractCegarLoop]: Abstraction has 61586 states and 68951 transitions. [2024-11-06 19:44:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:44:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 61586 states and 68951 transitions. [2024-11-06 19:44:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-06 19:44:52,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:52,536 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:44:52,549 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:44:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:52,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:52,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1083689169, now seen corresponding path program 1 times [2024-11-06 19:44:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111616315] [2024-11-06 19:44:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 229 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-06 19:44:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111616315] [2024-11-06 19:44:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111616315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:44:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59780391] [2024-11-06 19:44:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:53,418 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:44:53,420 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:44:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:53,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:44:53,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:44:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:44:53,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:44:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59780391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:53,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:44:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:44:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466376979] [2024-11-06 19:44:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:53,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:53,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:53,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:44:53,808 INFO L87 Difference]: Start difference. First operand 61586 states and 68951 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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:44:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:56,716 INFO L93 Difference]: Finished difference Result 157716 states and 177463 transitions. [2024-11-06 19:44:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 476 [2024-11-06 19:44:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:56,829 INFO L225 Difference]: With dead ends: 157716 [2024-11-06 19:44:56,830 INFO L226 Difference]: Without dead ends: 96883 [2024-11-06 19:44:56,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:44:56,870 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 615 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:56,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 978 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:44:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96883 states. [2024-11-06 19:44:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96883 to 96883. [2024-11-06 19:44:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96883 states, 96882 states have (on average 1.1168638137115254) internal successors, (108204), 96882 states have internal predecessors, (108204), 0 states have call successors, (0), 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:44:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96883 states to 96883 states and 108204 transitions. [2024-11-06 19:44:57,874 INFO L78 Accepts]: Start accepts. Automaton has 96883 states and 108204 transitions. Word has length 476 [2024-11-06 19:44:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:57,874 INFO L471 AbstractCegarLoop]: Abstraction has 96883 states and 108204 transitions. [2024-11-06 19:44:57,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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:44:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 96883 states and 108204 transitions. [2024-11-06 19:44:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-11-06 19:44:57,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:57,880 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:44:58,057 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:44:58,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:58,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:58,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 150900610, now seen corresponding path program 1 times [2024-11-06 19:44:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:58,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596327928] [2024-11-06 19:44:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 19:44:58,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596327928] [2024-11-06 19:44:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596327928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:58,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:44:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335241384] [2024-11-06 19:44:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:58,390 INFO L87 Difference]: Start difference. First operand 96883 states and 108204 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:45:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:01,223 INFO L93 Difference]: Finished difference Result 231314 states and 258927 transitions. [2024-11-06 19:45:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:01,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 486 [2024-11-06 19:45:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:01,458 INFO L225 Difference]: With dead ends: 231314 [2024-11-06 19:45:01,458 INFO L226 Difference]: Without dead ends: 135184 [2024-11-06 19:45:01,532 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:45:01,533 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 571 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:01,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1226 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:45:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135184 states. [2024-11-06 19:45:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135184 to 130678. [2024-11-06 19:45:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130678 states, 130677 states have (on average 1.1148097982047338) internal successors, (145680), 130677 states have internal predecessors, (145680), 0 states have call successors, (0), 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:45:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130678 states to 130678 states and 145680 transitions. [2024-11-06 19:45:03,243 INFO L78 Accepts]: Start accepts. Automaton has 130678 states and 145680 transitions. Word has length 486 [2024-11-06 19:45:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:03,244 INFO L471 AbstractCegarLoop]: Abstraction has 130678 states and 145680 transitions. [2024-11-06 19:45:03,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:45:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 130678 states and 145680 transitions. [2024-11-06 19:45:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-06 19:45:03,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:03,261 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:45:03,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1053925819, now seen corresponding path program 1 times [2024-11-06 19:45:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103964858] [2024-11-06 19:45:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-06 19:45:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103964858] [2024-11-06 19:45:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103964858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:04,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:04,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531317653] [2024-11-06 19:45:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:04,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:04,173 INFO L87 Difference]: Start difference. First operand 130678 states and 145680 transitions. Second operand has 3 states, 3 states have (on average 128.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:45:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:07,091 INFO L93 Difference]: Finished difference Result 288390 states and 322814 transitions. [2024-11-06 19:45:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.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 568 [2024-11-06 19:45:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:07,307 INFO L225 Difference]: With dead ends: 288390 [2024-11-06 19:45:07,307 INFO L226 Difference]: Without dead ends: 158465 [2024-11-06 19:45:07,356 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:45:07,357 INFO L432 NwaCegarLoop]: 1272 mSDtfsCounter, 581 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:07,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1280 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158465 states. [2024-11-06 19:45:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158465 to 154710. [2024-11-06 19:45:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154710 states, 154709 states have (on average 1.1077829990498291) internal successors, (171384), 154709 states have internal predecessors, (171384), 0 states have call successors, (0), 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:45:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154710 states to 154710 states and 171384 transitions. [2024-11-06 19:45:09,081 INFO L78 Accepts]: Start accepts. Automaton has 154710 states and 171384 transitions. Word has length 568 [2024-11-06 19:45:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:09,081 INFO L471 AbstractCegarLoop]: Abstraction has 154710 states and 171384 transitions. [2024-11-06 19:45:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.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:45:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 154710 states and 171384 transitions. [2024-11-06 19:45:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-06 19:45:09,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:09,429 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, 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, 2, 2, 2, 2, 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] [2024-11-06 19:45:09,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:45:09,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:09,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash -705218746, now seen corresponding path program 1 times [2024-11-06 19:45:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738074189] [2024-11-06 19:45:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:45:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738074189] [2024-11-06 19:45:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738074189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:09,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655575498] [2024-11-06 19:45:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:09,824 INFO L87 Difference]: Start difference. First operand 154710 states and 171384 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) 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:45:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:13,058 INFO L93 Difference]: Finished difference Result 361988 states and 402918 transitions. [2024-11-06 19:45:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:13,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) 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 582 [2024-11-06 19:45:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:13,336 INFO L225 Difference]: With dead ends: 361988 [2024-11-06 19:45:13,336 INFO L226 Difference]: Without dead ends: 208031 [2024-11-06 19:45:13,406 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:45:13,407 INFO L432 NwaCegarLoop]: 1240 mSDtfsCounter, 549 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:13,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1247 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208031 states. [2024-11-06 19:45:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208031 to 198268. [2024-11-06 19:45:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198268 states, 198267 states have (on average 1.0927184049791443) internal successors, (216650), 198267 states have internal predecessors, (216650), 0 states have call successors, (0), 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:45:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198268 states to 198268 states and 216650 transitions. [2024-11-06 19:45:15,941 INFO L78 Accepts]: Start accepts. Automaton has 198268 states and 216650 transitions. Word has length 582 [2024-11-06 19:45:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:15,942 INFO L471 AbstractCegarLoop]: Abstraction has 198268 states and 216650 transitions. [2024-11-06 19:45:15,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) 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:45:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 198268 states and 216650 transitions. [2024-11-06 19:45:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-11-06 19:45:15,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:15,960 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:45:15,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:15,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1377065374, now seen corresponding path program 1 times [2024-11-06 19:45:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254238274] [2024-11-06 19:45:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-06 19:45:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254238274] [2024-11-06 19:45:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254238274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888348296] [2024-11-06 19:45:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:16,239 INFO L87 Difference]: Start difference. First operand 198268 states and 216650 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)