./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label59.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/Problem13_label59.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', 'e95469d39d3368d14177394b02d3829b8d37dd10304149f6e91cf64fc01c6cbc'] 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/Problem13_label59.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 e95469d39d3368d14177394b02d3829b8d37dd10304149f6e91cf64fc01c6cbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:51:52,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:51:52,302 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:51:52,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:51:52,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:51:52,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:51:52,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:51:52,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:51:52,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:51:52,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:51:52,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:51:52,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:51:52,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:51:52,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:51:52,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:51:52,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:51:52,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:51:52,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:51:52,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:51:52,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:51:52,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:51:52,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:51:52,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:51:52,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:51:52,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:51:52,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:51:52,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:51:52,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:51:52,331 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 -> e95469d39d3368d14177394b02d3829b8d37dd10304149f6e91cf64fc01c6cbc [2024-11-06 19:51:52,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:51:52,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:51:52,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:51:52,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:51:52,596 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:51:52,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label59.c [2024-11-06 19:51:53,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:51:54,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:51:54,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label59.c [2024-11-06 19:51:54,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d7560dc5/0c9e74cc5ce8441e856b8f255009d92b/FLAG1b3c82868 [2024-11-06 19:51:54,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d7560dc5/0c9e74cc5ce8441e856b8f255009d92b [2024-11-06 19:51:54,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:51:54,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:51:54,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:51:54,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:51:54,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:51:54,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:54" (1/1) ... [2024-11-06 19:51:54,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfa7d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:54, skipping insertion in model container [2024-11-06 19:51:54,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:54" (1/1) ... [2024-11-06 19:51:54,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:51:54,916 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/Problem13_label59.c[6607,6620] [2024-11-06 19:51:55,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:51:55,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:51:55,635 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/Problem13_label59.c[6607,6620] [2024-11-06 19:51:56,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:51:56,038 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:51:56,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56 WrapperNode [2024-11-06 19:51:56,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:51:56,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:51:56,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:51:56,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:51:56,045 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:51:56" (1/1) ... [2024-11-06 19:51:56,118 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:51:56" (1/1) ... [2024-11-06 19:51:56,724 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:51:56,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:51:56,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:51:56,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:51:56,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:51:56,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:56,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:56,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,079 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:51:57,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:51:57,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:51:57,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:51:57,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:51:57,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (1/1) ... [2024-11-06 19:51:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:51:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:57,456 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:51:57,459 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:51:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:51:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:51:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:51:57,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:51:57,552 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:51:57,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:52:03,642 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:52:03,643 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:52:03,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:52:03,688 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:52:03,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:03 BoogieIcfgContainer [2024-11-06 19:52:03,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:52:03,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:52:03,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:52:03,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:52:03,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:51:54" (1/3) ... [2024-11-06 19:52:03,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76be849d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:03, skipping insertion in model container [2024-11-06 19:52:03,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:56" (2/3) ... [2024-11-06 19:52:03,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76be849d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:03, skipping insertion in model container [2024-11-06 19:52:03,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:03" (3/3) ... [2024-11-06 19:52:03,698 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label59.c [2024-11-06 19:52:03,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:52:03,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:52:03,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:52:03,813 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;@7a71c5ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:52:03,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:52:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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:52:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 19:52:03,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:03,834 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] [2024-11-06 19:52:03,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:03,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2024-11-06 19:52:03,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:03,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880345187] [2024-11-06 19:52:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:04,221 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:52:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880345187] [2024-11-06 19:52:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880345187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:04,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020596903] [2024-11-06 19:52:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:04,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:04,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:04,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:04,256 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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:52:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:08,582 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-06 19:52:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:08,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-06 19:52:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:08,603 INFO L225 Difference]: With dead ends: 3160 [2024-11-06 19:52:08,604 INFO L226 Difference]: Without dead ends: 1983 [2024-11-06 19:52:08,609 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:52:08,612 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1057 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:08,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-06 19:52:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-06 19:52:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-06 19:52:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 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:52:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-06 19:52:08,723 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 46 [2024-11-06 19:52:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:08,724 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-06 19:52:08,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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:52:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-06 19:52:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 19:52:08,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:08,727 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, 1, 1, 1, 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:52:08,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:52:08,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -928496590, now seen corresponding path program 1 times [2024-11-06 19:52:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65709577] [2024-11-06 19:52:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65709577] [2024-11-06 19:52:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65709577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822579358] [2024-11-06 19:52:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:09,037 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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:52:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:12,286 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-06 19:52:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:12,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-06 19:52:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:12,303 INFO L225 Difference]: With dead ends: 5456 [2024-11-06 19:52:12,303 INFO L226 Difference]: Without dead ends: 3528 [2024-11-06 19:52:12,307 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:52:12,307 INFO L432 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:12,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:52:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-06 19:52:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-06 19:52:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 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:52:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-06 19:52:12,394 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 111 [2024-11-06 19:52:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-06 19:52:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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:52:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-06 19:52:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 19:52:12,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:12,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:52:12,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2127816963, now seen corresponding path program 1 times [2024-11-06 19:52:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630042872] [2024-11-06 19:52:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630042872] [2024-11-06 19:52:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630042872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536678918] [2024-11-06 19:52:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:12,594 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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:52:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:15,579 INFO L93 Difference]: Finished difference Result 10234 states and 16098 transitions. [2024-11-06 19:52:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-06 19:52:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:15,605 INFO L225 Difference]: With dead ends: 10234 [2024-11-06 19:52:15,606 INFO L226 Difference]: Without dead ends: 6710 [2024-11-06 19:52:15,612 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:52:15,613 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 973 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:15,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 852 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:52:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2024-11-06 19:52:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6700. [2024-11-06 19:52:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 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:52:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-06 19:52:15,738 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 117 [2024-11-06 19:52:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:15,739 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-06 19:52:15,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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:52:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-06 19:52:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-06 19:52:15,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:15,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:52:15,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:15,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1371058456, now seen corresponding path program 1 times [2024-11-06 19:52:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514882677] [2024-11-06 19:52:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514882677] [2024-11-06 19:52:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514882677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:15,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63296776] [2024-11-06 19:52:15,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:15,973 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:19,508 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-06 19:52:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:19,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-06 19:52:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:19,541 INFO L225 Difference]: With dead ends: 17443 [2024-11-06 19:52:19,542 INFO L226 Difference]: Without dead ends: 10745 [2024-11-06 19:52:19,551 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:52:19,552 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:19,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:52:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-06 19:52:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-06 19:52:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 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:52:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-06 19:52:19,724 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 147 [2024-11-06 19:52:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:19,725 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-06 19:52:19,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-06 19:52:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-06 19:52:19,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:19,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:52:19,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2110509215, now seen corresponding path program 1 times [2024-11-06 19:52:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977661419] [2024-11-06 19:52:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977661419] [2024-11-06 19:52:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977661419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:20,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:20,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419375007] [2024-11-06 19:52:20,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:20,136 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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:52:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:22,813 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-06 19:52:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-06 19:52:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:22,841 INFO L225 Difference]: With dead ends: 20549 [2024-11-06 19:52:22,842 INFO L226 Difference]: Without dead ends: 10669 [2024-11-06 19:52:22,851 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:52:22,852 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:22,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:52:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-06 19:52:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-06 19:52:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 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:52:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-06 19:52:23,066 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 157 [2024-11-06 19:52:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:23,066 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-06 19:52:23,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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:52:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-06 19:52:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-06 19:52:23,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:23,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:52:23,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash -339079179, now seen corresponding path program 1 times [2024-11-06 19:52:23,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543620945] [2024-11-06 19:52:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543620945] [2024-11-06 19:52:23,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543620945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:23,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774262443] [2024-11-06 19:52:23,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:23,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:23,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:23,259 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:52:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:26,443 INFO L93 Difference]: Finished difference Result 29991 states and 41155 transitions. [2024-11-06 19:52:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:26,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-06 19:52:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:26,488 INFO L225 Difference]: With dead ends: 29991 [2024-11-06 19:52:26,488 INFO L226 Difference]: Without dead ends: 20111 [2024-11-06 19:52:26,503 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:52:26,504 INFO L432 NwaCegarLoop]: 1849 mSDtfsCounter, 891 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:26,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1988 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:52:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20111 states. [2024-11-06 19:52:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20111 to 19314. [2024-11-06 19:52:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19314 states, 19313 states have (on average 1.2808470978097655) internal successors, (24737), 19313 states have internal predecessors, (24737), 0 states have call successors, (0), 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:52:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19314 states to 19314 states and 24737 transitions. [2024-11-06 19:52:26,800 INFO L78 Accepts]: Start accepts. Automaton has 19314 states and 24737 transitions. Word has length 171 [2024-11-06 19:52:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 19314 states and 24737 transitions. [2024-11-06 19:52:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:52:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19314 states and 24737 transitions. [2024-11-06 19:52:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-06 19:52:26,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:26,809 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:26,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:52:26,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1894492209, now seen corresponding path program 1 times [2024-11-06 19:52:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904974039] [2024-11-06 19:52:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 19:52:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904974039] [2024-11-06 19:52:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904974039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:52:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000902804] [2024-11-06 19:52:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:27,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:27,163 INFO L87 Difference]: Start difference. First operand 19314 states and 24737 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:52:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:30,167 INFO L93 Difference]: Finished difference Result 44944 states and 56956 transitions. [2024-11-06 19:52:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 258 [2024-11-06 19:52:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:30,215 INFO L225 Difference]: With dead ends: 44944 [2024-11-06 19:52:30,215 INFO L226 Difference]: Without dead ends: 25632 [2024-11-06 19:52:30,238 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:52:30,239 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 728 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:30,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1192 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:52:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25632 states. [2024-11-06 19:52:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25632 to 25622. [2024-11-06 19:52:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25622 states, 25621 states have (on average 1.232621677530151) internal successors, (31581), 25621 states have internal predecessors, (31581), 0 states have call successors, (0), 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:52:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25622 states to 25622 states and 31581 transitions. [2024-11-06 19:52:30,627 INFO L78 Accepts]: Start accepts. Automaton has 25622 states and 31581 transitions. Word has length 258 [2024-11-06 19:52:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:30,628 INFO L471 AbstractCegarLoop]: Abstraction has 25622 states and 31581 transitions. [2024-11-06 19:52:30,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:52:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 25622 states and 31581 transitions. [2024-11-06 19:52:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-06 19:52:30,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:30,633 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:52:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:52:30,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash -561364737, now seen corresponding path program 1 times [2024-11-06 19:52:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691114330] [2024-11-06 19:52:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:30,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:30,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691114330] [2024-11-06 19:52:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691114330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:30,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:30,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396946654] [2024-11-06 19:52:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:30,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:30,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:30,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:30,832 INFO L87 Difference]: Start difference. First operand 25622 states and 31581 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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:52:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:34,051 INFO L93 Difference]: Finished difference Result 72509 states and 89970 transitions. [2024-11-06 19:52:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-06 19:52:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:34,115 INFO L225 Difference]: With dead ends: 72509 [2024-11-06 19:52:34,115 INFO L226 Difference]: Without dead ends: 47676 [2024-11-06 19:52:34,146 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:52:34,147 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 827 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:34,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 898 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:52:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47676 states. [2024-11-06 19:52:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47676 to 46091. [2024-11-06 19:52:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46091 states, 46090 states have (on average 1.1851377739205902) internal successors, (54623), 46090 states have internal predecessors, (54623), 0 states have call successors, (0), 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:52:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46091 states to 46091 states and 54623 transitions. [2024-11-06 19:52:34,752 INFO L78 Accepts]: Start accepts. Automaton has 46091 states and 54623 transitions. Word has length 273 [2024-11-06 19:52:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:34,753 INFO L471 AbstractCegarLoop]: Abstraction has 46091 states and 54623 transitions. [2024-11-06 19:52:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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:52:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 46091 states and 54623 transitions. [2024-11-06 19:52:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-06 19:52:34,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:34,757 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:52:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:52:34,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:34,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1177672583, now seen corresponding path program 1 times [2024-11-06 19:52:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:34,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578524543] [2024-11-06 19:52:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:52:35,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578524543] [2024-11-06 19:52:35,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578524543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:52:35,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557510631] [2024-11-06 19:52:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:52:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:52:35,914 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:52:35,916 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:52:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:36,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:52:36,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:52:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:52:36,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:52:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557510631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:36,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:52:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:52:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645454487] [2024-11-06 19:52:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:36,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:36,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:52:36,217 INFO L87 Difference]: Start difference. First operand 46091 states and 54623 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:39,159 INFO L93 Difference]: Finished difference Result 91391 states and 108451 transitions. [2024-11-06 19:52:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-11-06 19:52:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:39,217 INFO L225 Difference]: With dead ends: 91391 [2024-11-06 19:52:39,217 INFO L226 Difference]: Without dead ends: 46089 [2024-11-06 19:52:39,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:52:39,252 INFO L432 NwaCegarLoop]: 1359 mSDtfsCounter, 1160 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:39,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1441 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:52:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46089 states. [2024-11-06 19:52:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46089 to 46088. [2024-11-06 19:52:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46088 states, 46087 states have (on average 1.150693254062968) internal successors, (53032), 46087 states have internal predecessors, (53032), 0 states have call successors, (0), 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:52:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46088 states to 46088 states and 53032 transitions. [2024-11-06 19:52:39,823 INFO L78 Accepts]: Start accepts. Automaton has 46088 states and 53032 transitions. Word has length 287 [2024-11-06 19:52:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:39,823 INFO L471 AbstractCegarLoop]: Abstraction has 46088 states and 53032 transitions. [2024-11-06 19:52:39,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 46088 states and 53032 transitions. [2024-11-06 19:52:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-06 19:52:39,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:39,829 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:39,847 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:52:40,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:52:40,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:40,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1768426365, now seen corresponding path program 1 times [2024-11-06 19:52:40,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:40,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598509049] [2024-11-06 19:52:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:40,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 216 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-06 19:52:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598509049] [2024-11-06 19:52:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598509049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:52:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818702239] [2024-11-06 19:52:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:41,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:52:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:52:41,323 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:52:41,325 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:52:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:41,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:52:41,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:52:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:52:41,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:52:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818702239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:52:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:52:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804778350] [2024-11-06 19:52:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:41,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:41,587 INFO L87 Difference]: Start difference. First operand 46088 states and 53032 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:44,308 INFO L93 Difference]: Finished difference Result 91376 states and 105260 transitions. [2024-11-06 19:52:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:44,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2024-11-06 19:52:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:44,356 INFO L225 Difference]: With dead ends: 91376 [2024-11-06 19:52:44,356 INFO L226 Difference]: Without dead ends: 46077 [2024-11-06 19:52:44,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:44,385 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 1075 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:44,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 817 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:52:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46077 states. [2024-11-06 19:52:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46077 to 46074. [2024-11-06 19:52:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46074 states, 46073 states have (on average 1.1090443426735832) internal successors, (51097), 46073 states have internal predecessors, (51097), 0 states have call successors, (0), 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:52:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46074 states to 46074 states and 51097 transitions. [2024-11-06 19:52:44,808 INFO L78 Accepts]: Start accepts. Automaton has 46074 states and 51097 transitions. Word has length 352 [2024-11-06 19:52:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:44,808 INFO L471 AbstractCegarLoop]: Abstraction has 46074 states and 51097 transitions. [2024-11-06 19:52:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 46074 states and 51097 transitions. [2024-11-06 19:52:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-06 19:52:44,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:44,816 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:44,833 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:52:45,016 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:52:45,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:45,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 143007617, now seen corresponding path program 1 times [2024-11-06 19:52:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437177595] [2024-11-06 19:52:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-06 19:52:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437177595] [2024-11-06 19:52:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437177595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616052403] [2024-11-06 19:52:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:52:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:52:45,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:52:45,262 INFO L87 Difference]: Start difference. First operand 46074 states and 51097 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:52:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:51,580 INFO L93 Difference]: Finished difference Result 122259 states and 136283 transitions. [2024-11-06 19:52:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:52:51,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 394 [2024-11-06 19:52:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:51,672 INFO L225 Difference]: With dead ends: 122259 [2024-11-06 19:52:51,672 INFO L226 Difference]: Without dead ends: 76974 [2024-11-06 19:52:51,708 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:52:51,709 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 1700 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6751 mSolverCounterSat, 1002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 7753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 6751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:51,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 892 Invalid, 7753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1002 Valid, 6751 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-06 19:52:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76974 states. [2024-11-06 19:52:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76974 to 57894. [2024-11-06 19:52:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57894 states, 57893 states have (on average 1.1003575561812309) internal successors, (63703), 57893 states have internal predecessors, (63703), 0 states have call successors, (0), 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:52:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57894 states to 57894 states and 63703 transitions. [2024-11-06 19:52:52,469 INFO L78 Accepts]: Start accepts. Automaton has 57894 states and 63703 transitions. Word has length 394 [2024-11-06 19:52:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:52,469 INFO L471 AbstractCegarLoop]: Abstraction has 57894 states and 63703 transitions. [2024-11-06 19:52:52,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:52:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57894 states and 63703 transitions. [2024-11-06 19:52:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-06 19:52:52,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:52,479 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:52:52,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1259811683, now seen corresponding path program 1 times [2024-11-06 19:52:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152677915] [2024-11-06 19:52:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 19:52:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152677915] [2024-11-06 19:52:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152677915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713188510] [2024-11-06 19:52:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:52,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:52,756 INFO L87 Difference]: Start difference. First operand 57894 states and 63703 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:52:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:56,118 INFO L93 Difference]: Finished difference Result 139407 states and 154440 transitions. [2024-11-06 19:52:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:56,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:52:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:56,206 INFO L225 Difference]: With dead ends: 139407 [2024-11-06 19:52:56,206 INFO L226 Difference]: Without dead ends: 82302 [2024-11-06 19:52:56,236 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:52:56,236 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 831 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:56,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 833 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:52:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82302 states. [2024-11-06 19:52:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82302 to 80710. [2024-11-06 19:52:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80710 states, 80709 states have (on average 1.1005959682315478) internal successors, (88828), 80709 states have internal predecessors, (88828), 0 states have call successors, (0), 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:52:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80710 states to 80710 states and 88828 transitions. [2024-11-06 19:52:57,087 INFO L78 Accepts]: Start accepts. Automaton has 80710 states and 88828 transitions. Word has length 407 [2024-11-06 19:52:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:57,088 INFO L471 AbstractCegarLoop]: Abstraction has 80710 states and 88828 transitions. [2024-11-06 19:52:57,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:52:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80710 states and 88828 transitions. [2024-11-06 19:52:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 19:52:57,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:57,095 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, 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, 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] [2024-11-06 19:52:57,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:52:57,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:57,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1404182117, now seen corresponding path program 1 times [2024-11-06 19:52:57,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:57,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924049837] [2024-11-06 19:52:57,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:52:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924049837] [2024-11-06 19:52:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924049837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91347458] [2024-11-06 19:52:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:57,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:57,627 INFO L87 Difference]: Start difference. First operand 80710 states and 88828 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:53:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:00,558 INFO L93 Difference]: Finished difference Result 182696 states and 200598 transitions. [2024-11-06 19:53:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2024-11-06 19:53:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:00,672 INFO L225 Difference]: With dead ends: 182696 [2024-11-06 19:53:00,672 INFO L226 Difference]: Without dead ends: 102775 [2024-11-06 19:53:00,705 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:53:00,706 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 804 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:00,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1114 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:53:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102775 states. [2024-11-06 19:53:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102775 to 98815. [2024-11-06 19:53:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98815 states, 98814 states have (on average 1.0907260104843444) internal successors, (107779), 98814 states have internal predecessors, (107779), 0 states have call successors, (0), 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:53:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98815 states to 98815 states and 107779 transitions. [2024-11-06 19:53:01,659 INFO L78 Accepts]: Start accepts. Automaton has 98815 states and 107779 transitions. Word has length 427 [2024-11-06 19:53:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:01,659 INFO L471 AbstractCegarLoop]: Abstraction has 98815 states and 107779 transitions. [2024-11-06 19:53:01,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:53:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98815 states and 107779 transitions. [2024-11-06 19:53:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-06 19:53:01,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:01,665 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:53:01,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:53:01,665 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:01,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -625667605, now seen corresponding path program 1 times [2024-11-06 19:53:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316419222] [2024-11-06 19:53:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 388 proven. 110 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-06 19:53:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316419222] [2024-11-06 19:53:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316419222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:53:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530129781] [2024-11-06 19:53:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:53:03,035 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:53:03,038 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:53:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:03,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:53:03,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:53:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-11-06 19:53:03,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:53:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530129781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:53:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:53:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854777509] [2024-11-06 19:53:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:03,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:53:03,242 INFO L87 Difference]: Start difference. First operand 98815 states and 107779 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:53:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:53:06,442 INFO L93 Difference]: Finished difference Result 198419 states and 216356 transitions. [2024-11-06 19:53:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:53:06,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 437 [2024-11-06 19:53:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:53:06,561 INFO L225 Difference]: With dead ends: 198419 [2024-11-06 19:53:06,561 INFO L226 Difference]: Without dead ends: 100393 [2024-11-06 19:53:06,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:53:06,602 INFO L432 NwaCegarLoop]: 1385 mSDtfsCounter, 993 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:53:06,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1471 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:53:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100393 states. [2024-11-06 19:53:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100393 to 98807. [2024-11-06 19:53:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98807 states, 98806 states have (on average 1.067111309029816) internal successors, (105437), 98806 states have internal predecessors, (105437), 0 states have call successors, (0), 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:53:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98807 states to 98807 states and 105437 transitions. [2024-11-06 19:53:07,714 INFO L78 Accepts]: Start accepts. Automaton has 98807 states and 105437 transitions. Word has length 437 [2024-11-06 19:53:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:53:07,714 INFO L471 AbstractCegarLoop]: Abstraction has 98807 states and 105437 transitions. [2024-11-06 19:53:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:53:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 98807 states and 105437 transitions. [2024-11-06 19:53:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-06 19:53:07,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:53:07,725 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:53:07,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 19:53:07,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:53:07,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:53:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:53:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1887672211, now seen corresponding path program 1 times [2024-11-06 19:53:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:53:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546617033] [2024-11-06 19:53:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:53:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:53:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:53:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 19:53:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:53:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546617033] [2024-11-06 19:53:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546617033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:53:08,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:53:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:53:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61594347] [2024-11-06 19:53:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:53:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:53:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:53:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:53:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:53:08,417 INFO L87 Difference]: Start difference. First operand 98807 states and 105437 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)