./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label42.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/Problem15_label42.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', '3fcd708947a4bb98de639b7d2a0b691cd973d0d2cb21e8c27c8bb20175929abf'] 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/Problem15_label42.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 3fcd708947a4bb98de639b7d2a0b691cd973d0d2cb21e8c27c8bb20175929abf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:58:08,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:58:08,449 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:58:08,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:58:08,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:58:08,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:58:08,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:58:08,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:58:08,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:58:08,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:58:08,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:58:08,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:58:08,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:58:08,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:58:08,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:58:08,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:58:08,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:58:08,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:58:08,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:58:08,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:58:08,482 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 -> 3fcd708947a4bb98de639b7d2a0b691cd973d0d2cb21e8c27c8bb20175929abf [2024-11-06 19:58:08,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:58:08,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:58:08,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:58:08,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:58:08,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:58:08,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label42.c [2024-11-06 19:58:09,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:58:10,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:58:10,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label42.c [2024-11-06 19:58:10,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3f0a89dd/101158d670574bf7ab42210ba20a79b4/FLAG55b83ec52 [2024-11-06 19:58:10,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3f0a89dd/101158d670574bf7ab42210ba20a79b4 [2024-11-06 19:58:10,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:58:10,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:58:10,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:58:10,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:58:10,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:58:10,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:10,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed01b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10, skipping insertion in model container [2024-11-06 19:58:10,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:10,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:58:10,542 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/Problem15_label42.c[5695,5708] [2024-11-06 19:58:10,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:58:10,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:58:10,789 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/Problem15_label42.c[5695,5708] [2024-11-06 19:58:10,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:58:10,902 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:58:10,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10 WrapperNode [2024-11-06 19:58:10,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:58:10,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:58:10,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:58:10,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:58:10,908 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:58:10" (1/1) ... [2024-11-06 19:58:10,930 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:58:10" (1/1) ... [2024-11-06 19:58:11,043 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:58:11,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:58:11,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:58:11,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:58:11,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:58:11,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,151 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:58:11,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:58:11,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:58:11,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:58:11,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:58:11,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (1/1) ... [2024-11-06 19:58:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:58:11,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:58:11,362 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:58:11,365 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:58:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:58:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:58:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:58:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:58:11,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:58:11,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:58:13,212 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:58:13,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:58:13,228 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:58:13,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:58:13,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:58:13 BoogieIcfgContainer [2024-11-06 19:58:13,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:58:13,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:58:13,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:58:13,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:58:13,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:58:10" (1/3) ... [2024-11-06 19:58:13,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1f99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:58:13, skipping insertion in model container [2024-11-06 19:58:13,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:10" (2/3) ... [2024-11-06 19:58:13,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1f99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:58:13, skipping insertion in model container [2024-11-06 19:58:13,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:58:13" (3/3) ... [2024-11-06 19:58:13,238 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label42.c [2024-11-06 19:58:13,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:58:13,248 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:58:13,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:58:13,298 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;@6b0435fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:58:13,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:58:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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:58:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 19:58:13,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:13,309 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:58:13,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2024-11-06 19:58:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:13,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154753992] [2024-11-06 19:58:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:13,540 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:58:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154753992] [2024-11-06 19:58:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154753992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:58:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260147807] [2024-11-06 19:58:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:13,561 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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:58:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:15,313 INFO L93 Difference]: Finished difference Result 1191 states and 2157 transitions. [2024-11-06 19:58:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:15,315 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:58:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:15,325 INFO L225 Difference]: With dead ends: 1191 [2024-11-06 19:58:15,325 INFO L226 Difference]: Without dead ends: 688 [2024-11-06 19:58:15,328 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:58:15,331 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 325 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:15,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 19:58:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-06 19:58:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2024-11-06 19:58:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 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:58:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2024-11-06 19:58:15,392 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 46 [2024-11-06 19:58:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2024-11-06 19:58:15,393 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:58:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2024-11-06 19:58:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 19:58:15,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:15,398 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] [2024-11-06 19:58:15,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:58:15,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash -126455687, now seen corresponding path program 1 times [2024-11-06 19:58:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612720074] [2024-11-06 19:58:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:15,611 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:58:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:15,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612720074] [2024-11-06 19:58:15,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612720074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:58:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564022489] [2024-11-06 19:58:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:15,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:15,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:15,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:15,613 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:58:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:16,726 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2024-11-06 19:58:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-06 19:58:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:16,730 INFO L225 Difference]: With dead ends: 1964 [2024-11-06 19:58:16,731 INFO L226 Difference]: Without dead ends: 1286 [2024-11-06 19:58:16,733 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:58:16,734 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:16,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:58:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-06 19:58:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2024-11-06 19:58:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 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:58:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2024-11-06 19:58:16,797 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 114 [2024-11-06 19:58:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:16,799 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2024-11-06 19:58:16,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:58:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2024-11-06 19:58:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-06 19:58:16,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:16,805 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] [2024-11-06 19:58:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:58:16,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1586174363, now seen corresponding path program 1 times [2024-11-06 19:58:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296586781] [2024-11-06 19:58:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:17,055 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:58:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296586781] [2024-11-06 19:58:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296586781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250037893] [2024-11-06 19:58:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:17,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:17,057 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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:58:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:18,174 INFO L93 Difference]: Finished difference Result 3766 states and 5246 transitions. [2024-11-06 19:58:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-06 19:58:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:18,182 INFO L225 Difference]: With dead ends: 3766 [2024-11-06 19:58:18,182 INFO L226 Difference]: Without dead ends: 2487 [2024-11-06 19:58:18,183 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:58:18,186 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 282 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:18,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:58:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-06 19:58:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2487. [2024-11-06 19:58:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.244569589702333) internal successors, (3094), 2486 states have internal predecessors, (3094), 0 states have call successors, (0), 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:58:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3094 transitions. [2024-11-06 19:58:18,217 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3094 transitions. Word has length 122 [2024-11-06 19:58:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:18,218 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3094 transitions. [2024-11-06 19:58:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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:58:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3094 transitions. [2024-11-06 19:58:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 19:58:18,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:18,220 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] [2024-11-06 19:58:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:58:18,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:18,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1437214791, now seen corresponding path program 1 times [2024-11-06 19:58:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424951267] [2024-11-06 19:58:18,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:18,350 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:58:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424951267] [2024-11-06 19:58:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424951267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:58:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402350574] [2024-11-06 19:58:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:18,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:18,353 INFO L87 Difference]: Start difference. First operand 2487 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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:58:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:19,531 INFO L93 Difference]: Finished difference Result 6173 states and 7859 transitions. [2024-11-06 19:58:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-06 19:58:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:19,540 INFO L225 Difference]: With dead ends: 6173 [2024-11-06 19:58:19,540 INFO L226 Difference]: Without dead ends: 3688 [2024-11-06 19:58:19,542 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:58:19,542 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 234 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:19,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 363 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:58:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2024-11-06 19:58:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3686. [2024-11-06 19:58:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 1.198100407055631) internal successors, (4415), 3685 states have internal predecessors, (4415), 0 states have call successors, (0), 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:58:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4415 transitions. [2024-11-06 19:58:19,581 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4415 transitions. Word has length 128 [2024-11-06 19:58:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:19,581 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4415 transitions. [2024-11-06 19:58:19,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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:58:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4415 transitions. [2024-11-06 19:58:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-06 19:58:19,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:19,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:58:19,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1023010010, now seen corresponding path program 1 times [2024-11-06 19:58:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:19,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300392491] [2024-11-06 19:58:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:19,857 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:58:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300392491] [2024-11-06 19:58:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300392491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015715234] [2024-11-06 19:58:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:19,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:19,862 INFO L87 Difference]: Start difference. First operand 3686 states and 4415 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:58:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:21,093 INFO L93 Difference]: Finished difference Result 8572 states and 10503 transitions. [2024-11-06 19:58:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-06 19:58:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:21,103 INFO L225 Difference]: With dead ends: 8572 [2024-11-06 19:58:21,103 INFO L226 Difference]: Without dead ends: 4888 [2024-11-06 19:58:21,106 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:58:21,107 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 282 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:21,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:58:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2024-11-06 19:58:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4886. [2024-11-06 19:58:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4886 states, 4885 states have (on average 1.1733879222108496) internal successors, (5732), 4885 states have internal predecessors, (5732), 0 states have call successors, (0), 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:58:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 5732 transitions. [2024-11-06 19:58:21,154 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 5732 transitions. Word has length 242 [2024-11-06 19:58:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:21,155 INFO L471 AbstractCegarLoop]: Abstraction has 4886 states and 5732 transitions. [2024-11-06 19:58:21,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:58:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 5732 transitions. [2024-11-06 19:58:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-06 19:58:21,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:21,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:21,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:58:21,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -811672651, now seen corresponding path program 1 times [2024-11-06 19:58:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:21,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089347658] [2024-11-06 19:58:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-06 19:58:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089347658] [2024-11-06 19:58:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089347658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:58:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101725078] [2024-11-06 19:58:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:21,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:21,746 INFO L87 Difference]: Start difference. First operand 4886 states and 5732 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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:58:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:22,689 INFO L93 Difference]: Finished difference Result 10069 states and 11773 transitions. [2024-11-06 19:58:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 307 [2024-11-06 19:58:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:22,701 INFO L225 Difference]: With dead ends: 10069 [2024-11-06 19:58:22,701 INFO L226 Difference]: Without dead ends: 5185 [2024-11-06 19:58:22,705 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:58:22,706 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:22,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:58:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2024-11-06 19:58:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185. [2024-11-06 19:58:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5184 states have (on average 1.1645447530864197) internal successors, (6037), 5184 states have internal predecessors, (6037), 0 states have call successors, (0), 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:58:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 6037 transitions. [2024-11-06 19:58:22,759 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 6037 transitions. Word has length 307 [2024-11-06 19:58:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 5185 states and 6037 transitions. [2024-11-06 19:58:22,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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:58:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 6037 transitions. [2024-11-06 19:58:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-06 19:58:22,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:22,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:58:22,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash 105527406, now seen corresponding path program 1 times [2024-11-06 19:58:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687690504] [2024-11-06 19:58:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:22,981 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:58:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687690504] [2024-11-06 19:58:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687690504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301791438] [2024-11-06 19:58:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:22,983 INFO L87 Difference]: Start difference. First operand 5185 states and 6037 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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:58:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:24,406 INFO L93 Difference]: Finished difference Result 11271 states and 13444 transitions. [2024-11-06 19:58:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2024-11-06 19:58:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:24,418 INFO L225 Difference]: With dead ends: 11271 [2024-11-06 19:58:24,419 INFO L226 Difference]: Without dead ends: 6387 [2024-11-06 19:58:24,422 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:58:24,422 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 283 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:24,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:58:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2024-11-06 19:58:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6382. [2024-11-06 19:58:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6382 states, 6381 states have (on average 1.1548346654129447) internal successors, (7369), 6381 states have internal predecessors, (7369), 0 states have call successors, (0), 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:58:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 7369 transitions. [2024-11-06 19:58:24,494 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 7369 transitions. Word has length 328 [2024-11-06 19:58:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 6382 states and 7369 transitions. [2024-11-06 19:58:24,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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:58:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 7369 transitions. [2024-11-06 19:58:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-06 19:58:24,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:24,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:58:24,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2095815329, now seen corresponding path program 1 times [2024-11-06 19:58:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070951817] [2024-11-06 19:58:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:58:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070951817] [2024-11-06 19:58:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070951817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594175773] [2024-11-06 19:58:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:24,883 INFO L87 Difference]: Start difference. First operand 6382 states and 7369 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:58:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:26,018 INFO L93 Difference]: Finished difference Result 17555 states and 20251 transitions. [2024-11-06 19:58:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:26,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 393 [2024-11-06 19:58:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:26,039 INFO L225 Difference]: With dead ends: 17555 [2024-11-06 19:58:26,039 INFO L226 Difference]: Without dead ends: 8484 [2024-11-06 19:58:26,044 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:58:26,045 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 301 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:26,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 632 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:58:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2024-11-06 19:58:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 8185. [2024-11-06 19:58:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8185 states, 8184 states have (on average 1.1031280547409579) internal successors, (9028), 8184 states have internal predecessors, (9028), 0 states have call successors, (0), 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:58:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8185 states to 8185 states and 9028 transitions. [2024-11-06 19:58:26,114 INFO L78 Accepts]: Start accepts. Automaton has 8185 states and 9028 transitions. Word has length 393 [2024-11-06 19:58:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:26,115 INFO L471 AbstractCegarLoop]: Abstraction has 8185 states and 9028 transitions. [2024-11-06 19:58:26,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:58:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8185 states and 9028 transitions. [2024-11-06 19:58:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-06 19:58:26,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:26,124 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:26,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:58:26,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:26,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1049482387, now seen corresponding path program 1 times [2024-11-06 19:58:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192114230] [2024-11-06 19:58:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-06 19:58:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192114230] [2024-11-06 19:58:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192114230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172255159] [2024-11-06 19:58:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:26,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:26,368 INFO L87 Difference]: Start difference. First operand 8185 states and 9028 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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:58:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:27,467 INFO L93 Difference]: Finished difference Result 16365 states and 18094 transitions. [2024-11-06 19:58:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:27,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 547 [2024-11-06 19:58:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:27,481 INFO L225 Difference]: With dead ends: 16365 [2024-11-06 19:58:27,482 INFO L226 Difference]: Without dead ends: 8481 [2024-11-06 19:58:27,487 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:58:27,487 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:27,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:58:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2024-11-06 19:58:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 8181. [2024-11-06 19:58:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 8180 states have (on average 1.1028117359413203) internal successors, (9021), 8180 states have internal predecessors, (9021), 0 states have call successors, (0), 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:58:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 9021 transitions. [2024-11-06 19:58:27,543 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 9021 transitions. Word has length 547 [2024-11-06 19:58:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:27,544 INFO L471 AbstractCegarLoop]: Abstraction has 8181 states and 9021 transitions. [2024-11-06 19:58:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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:58:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 9021 transitions. [2024-11-06 19:58:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-06 19:58:27,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:27,552 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:58:27,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1504879367, now seen corresponding path program 1 times [2024-11-06 19:58:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567432904] [2024-11-06 19:58:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-06 19:58:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567432904] [2024-11-06 19:58:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567432904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:27,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810850771] [2024-11-06 19:58:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:27,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:27,756 INFO L87 Difference]: Start difference. First operand 8181 states and 9021 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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:58:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:28,571 INFO L93 Difference]: Finished difference Result 19051 states and 21177 transitions. [2024-11-06 19:58:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 556 [2024-11-06 19:58:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:28,615 INFO L225 Difference]: With dead ends: 19051 [2024-11-06 19:58:28,615 INFO L226 Difference]: Without dead ends: 10274 [2024-11-06 19:58:28,626 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:58:28,628 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 270 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:28,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 284 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:58:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10274 states. [2024-11-06 19:58:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10274 to 8178. [2024-11-06 19:58:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.090008560596796) internal successors, (8913), 8177 states have internal predecessors, (8913), 0 states have call successors, (0), 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:58:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 8913 transitions. [2024-11-06 19:58:28,766 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 8913 transitions. Word has length 556 [2024-11-06 19:58:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:28,768 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 8913 transitions. [2024-11-06 19:58:28,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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:58:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 8913 transitions. [2024-11-06 19:58:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-11-06 19:58:28,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:28,775 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:58:28,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1043281100, now seen corresponding path program 1 times [2024-11-06 19:58:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738812605] [2024-11-06 19:58:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 88 proven. 247 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 19:58:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738812605] [2024-11-06 19:58:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738812605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:58:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697073272] [2024-11-06 19:58:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:58:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:58:29,539 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:58:29,540 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:58:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:29,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:58:29,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:58:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-06 19:58:29,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:58:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697073272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:29,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:58:29,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:58:29,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408010736] [2024-11-06 19:58:29,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:29,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:29,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:29,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:58:29,825 INFO L87 Difference]: Start difference. First operand 8178 states and 8913 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:30,713 INFO L93 Difference]: Finished difference Result 18148 states and 19713 transitions. [2024-11-06 19:58:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:30,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 587 [2024-11-06 19:58:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:30,724 INFO L225 Difference]: With dead ends: 18148 [2024-11-06 19:58:30,724 INFO L226 Difference]: Without dead ends: 10271 [2024-11-06 19:58:30,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:58:30,730 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 267 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:30,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 256 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:58:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10271 states. [2024-11-06 19:58:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10271 to 8477. [2024-11-06 19:58:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8477 states, 8476 states have (on average 1.0903728173666825) internal successors, (9242), 8476 states have internal predecessors, (9242), 0 states have call successors, (0), 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:58:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8477 states to 8477 states and 9242 transitions. [2024-11-06 19:58:30,793 INFO L78 Accepts]: Start accepts. Automaton has 8477 states and 9242 transitions. Word has length 587 [2024-11-06 19:58:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:30,794 INFO L471 AbstractCegarLoop]: Abstraction has 8477 states and 9242 transitions. [2024-11-06 19:58:30,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8477 states and 9242 transitions. [2024-11-06 19:58:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-06 19:58:30,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:30,798 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,812 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:58:30,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:58:30,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:31,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1737683978, now seen corresponding path program 1 times [2024-11-06 19:58:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:31,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768678075] [2024-11-06 19:58:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-06 19:58:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768678075] [2024-11-06 19:58:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768678075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:31,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:31,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:31,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685162170] [2024-11-06 19:58:31,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:31,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:31,348 INFO L87 Difference]: Start difference. First operand 8477 states and 9242 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:58:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:32,237 INFO L93 Difference]: Finished difference Result 21152 states and 23165 transitions. [2024-11-06 19:58:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 613 [2024-11-06 19:58:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:32,249 INFO L225 Difference]: With dead ends: 21152 [2024-11-06 19:58:32,249 INFO L226 Difference]: Without dead ends: 12976 [2024-11-06 19:58:32,255 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:58:32,256 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 255 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:32,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 553 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:58:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2024-11-06 19:58:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 12965. [2024-11-06 19:58:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12965 states, 12964 states have (on average 1.0811477938907745) internal successors, (14016), 12964 states have internal predecessors, (14016), 0 states have call successors, (0), 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:58:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12965 states to 12965 states and 14016 transitions. [2024-11-06 19:58:32,352 INFO L78 Accepts]: Start accepts. Automaton has 12965 states and 14016 transitions. Word has length 613 [2024-11-06 19:58:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:32,352 INFO L471 AbstractCegarLoop]: Abstraction has 12965 states and 14016 transitions. [2024-11-06 19:58:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:58:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12965 states and 14016 transitions. [2024-11-06 19:58:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-11-06 19:58:32,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:32,359 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:58:32,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1326373647, now seen corresponding path program 1 times [2024-11-06 19:58:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908552102] [2024-11-06 19:58:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-06 19:58:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908552102] [2024-11-06 19:58:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908552102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:32,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:32,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93781336] [2024-11-06 19:58:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:32,612 INFO L87 Difference]: Start difference. First operand 12965 states and 14016 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:58:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:33,367 INFO L93 Difference]: Finished difference Result 28319 states and 30848 transitions. [2024-11-06 19:58:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 618 [2024-11-06 19:58:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:33,380 INFO L225 Difference]: With dead ends: 28319 [2024-11-06 19:58:33,381 INFO L226 Difference]: Without dead ends: 15655 [2024-11-06 19:58:33,389 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:58:33,390 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 302 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:33,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 423 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:58:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15655 states. [2024-11-06 19:58:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15655 to 15356. [2024-11-06 19:58:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15356 states, 15355 states have (on average 1.0854444806252035) internal successors, (16667), 15355 states have internal predecessors, (16667), 0 states have call successors, (0), 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:58:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 16667 transitions. [2024-11-06 19:58:33,534 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 16667 transitions. Word has length 618 [2024-11-06 19:58:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 15356 states and 16667 transitions. [2024-11-06 19:58:33,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:58:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 16667 transitions. [2024-11-06 19:58:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2024-11-06 19:58:33,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:33,541 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:58:33,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1381717930, now seen corresponding path program 1 times [2024-11-06 19:58:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181514532] [2024-11-06 19:58:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 88 proven. 247 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-06 19:58:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181514532] [2024-11-06 19:58:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181514532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:58:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752274425] [2024-11-06 19:58:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:58:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:58:34,256 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:58:34,257 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:58:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:34,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:58:34,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:58:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-06 19:58:34,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:58:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752274425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:58:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:58:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039737609] [2024-11-06 19:58:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:58:34,466 INFO L87 Difference]: Start difference. First operand 15356 states and 16667 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:35,203 INFO L93 Difference]: Finished difference Result 29807 states and 32400 transitions. [2024-11-06 19:58:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 642 [2024-11-06 19:58:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:35,214 INFO L225 Difference]: With dead ends: 29807 [2024-11-06 19:58:35,214 INFO L226 Difference]: Without dead ends: 14752 [2024-11-06 19:58:35,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:58:35,222 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 284 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:35,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 534 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:58:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2024-11-06 19:58:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 14153. [2024-11-06 19:58:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14153 states, 14152 states have (on average 1.0546919163369135) internal successors, (14926), 14152 states have internal predecessors, (14926), 0 states have call successors, (0), 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:58:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 14926 transitions. [2024-11-06 19:58:35,368 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 14926 transitions. Word has length 642 [2024-11-06 19:58:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:35,369 INFO L471 AbstractCegarLoop]: Abstraction has 14153 states and 14926 transitions. [2024-11-06 19:58:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 14926 transitions. [2024-11-06 19:58:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-11-06 19:58:35,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:35,378 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:58:35,391 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:58:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:58:35,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:35,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 62263666, now seen corresponding path program 1 times [2024-11-06 19:58:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709344775] [2024-11-06 19:58:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-06 19:58:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709344775] [2024-11-06 19:58:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709344775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780961009] [2024-11-06 19:58:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:35,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:35,968 INFO L87 Difference]: Start difference. First operand 14153 states and 14926 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:36,875 INFO L93 Difference]: Finished difference Result 32517 states and 34392 transitions. [2024-11-06 19:58:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 643 [2024-11-06 19:58:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:36,890 INFO L225 Difference]: With dead ends: 32517 [2024-11-06 19:58:36,890 INFO L226 Difference]: Without dead ends: 18665 [2024-11-06 19:58:36,898 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:58:36,899 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 289 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:36,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 243 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:58:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2024-11-06 19:58:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 15360. [2024-11-06 19:58:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15360 states, 15359 states have (on average 1.05449573539944) internal successors, (16196), 15359 states have internal predecessors, (16196), 0 states have call successors, (0), 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:58:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15360 states to 15360 states and 16196 transitions. [2024-11-06 19:58:37,012 INFO L78 Accepts]: Start accepts. Automaton has 15360 states and 16196 transitions. Word has length 643 [2024-11-06 19:58:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:37,013 INFO L471 AbstractCegarLoop]: Abstraction has 15360 states and 16196 transitions. [2024-11-06 19:58:37,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15360 states and 16196 transitions. [2024-11-06 19:58:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2024-11-06 19:58:37,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:37,018 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:58:37,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1332069740, now seen corresponding path program 1 times [2024-11-06 19:58:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15872513] [2024-11-06 19:58:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 19:58:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15872513] [2024-11-06 19:58:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15872513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280636191] [2024-11-06 19:58:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:37,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:37,336 INFO L87 Difference]: Start difference. First operand 15360 states and 16196 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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:58:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:38,205 INFO L93 Difference]: Finished difference Result 35810 states and 37757 transitions. [2024-11-06 19:58:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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 654 [2024-11-06 19:58:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:38,219 INFO L225 Difference]: With dead ends: 35810 [2024-11-06 19:58:38,219 INFO L226 Difference]: Without dead ends: 18060 [2024-11-06 19:58:38,228 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:58:38,229 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:38,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 534 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:58:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2024-11-06 19:58:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 15061. [2024-11-06 19:58:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15061 states, 15060 states have (on average 1.051660026560425) internal successors, (15838), 15060 states have internal predecessors, (15838), 0 states have call successors, (0), 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:58:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15061 states to 15061 states and 15838 transitions. [2024-11-06 19:58:38,351 INFO L78 Accepts]: Start accepts. Automaton has 15061 states and 15838 transitions. Word has length 654 [2024-11-06 19:58:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:38,351 INFO L471 AbstractCegarLoop]: Abstraction has 15061 states and 15838 transitions. [2024-11-06 19:58:38,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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:58:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15061 states and 15838 transitions. [2024-11-06 19:58:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2024-11-06 19:58:38,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:38,357 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:58:38,357 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:38,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1119185175, now seen corresponding path program 1 times [2024-11-06 19:58:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800823972] [2024-11-06 19:58:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2024-11-06 19:58:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:38,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800823972] [2024-11-06 19:58:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800823972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:38,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:38,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:58:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410760146] [2024-11-06 19:58:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:38,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:58:38,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:58:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:58:38,661 INFO L87 Difference]: Start difference. First operand 15061 states and 15838 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:58:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:39,467 INFO L93 Difference]: Finished difference Result 32822 states and 34548 transitions. [2024-11-06 19:58:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:58:39,468 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 655 [2024-11-06 19:58:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:39,480 INFO L225 Difference]: With dead ends: 32822 [2024-11-06 19:58:39,481 INFO L226 Difference]: Without dead ends: 18062 [2024-11-06 19:58:39,488 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:58:39,488 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 307 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:39,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 125 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:58:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18062 states. [2024-11-06 19:58:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18062 to 15954. [2024-11-06 19:58:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15954 states, 15953 states have (on average 1.0519651476211371) internal successors, (16782), 15953 states have internal predecessors, (16782), 0 states have call successors, (0), 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:58:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15954 states to 15954 states and 16782 transitions. [2024-11-06 19:58:39,650 INFO L78 Accepts]: Start accepts. Automaton has 15954 states and 16782 transitions. Word has length 655 [2024-11-06 19:58:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:39,651 INFO L471 AbstractCegarLoop]: Abstraction has 15954 states and 16782 transitions. [2024-11-06 19:58:39,651 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:58:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15954 states and 16782 transitions. [2024-11-06 19:58:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2024-11-06 19:58:39,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:58:39,662 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:39,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:58:39,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:58:39,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:58:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1436840268, now seen corresponding path program 1 times [2024-11-06 19:58:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:58:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741715807] [2024-11-06 19:58:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:58:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:58:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:58:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-06 19:58:40,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:58:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741715807] [2024-11-06 19:58:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741715807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:58:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:58:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:58:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986849842] [2024-11-06 19:58:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:58:40,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:58:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:58:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:58:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:58:40,023 INFO L87 Difference]: Start difference. First operand 15954 states and 16782 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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:58:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:58:41,075 INFO L93 Difference]: Finished difference Result 39080 states and 41040 transitions. [2024-11-06 19:58:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:58:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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 867 [2024-11-06 19:58:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:58:41,077 INFO L225 Difference]: With dead ends: 39080 [2024-11-06 19:58:41,077 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:58:41,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:58:41,088 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 604 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:58:41,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 219 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:58:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:58:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:58:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:58:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:58:41,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 867 [2024-11-06 19:58:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:58:41,089 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:58:41,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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:58:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:58:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:58:41,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:58:41,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:58:41,094 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:58:41,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:58:42,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:58:42,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:58:42 BoogieIcfgContainer [2024-11-06 19:58:42,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:58:42,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:58:42,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:58:42,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:58:42,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:58:13" (3/4) ... [2024-11-06 19:58:42,710 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:58:42,733 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:58:42,734 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:58:42,736 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:58:42,737 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:58:42,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:58:42,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:58:42,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:58:42,858 INFO L158 Benchmark]: Toolchain (without parser) took 32499.15ms. Allocated memory was 100.7MB in the beginning and 889.2MB in the end (delta: 788.5MB). Free memory was 71.9MB in the beginning and 315.4MB in the end (delta: -243.4MB). Peak memory consumption was 541.0MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,858 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:58:42,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.41ms. Allocated memory is still 100.7MB. Free memory was 71.8MB in the beginning and 35.3MB in the end (delta: 36.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.13ms. Allocated memory is still 100.7MB. Free memory was 35.3MB in the beginning and 35.9MB in the end (delta: -658.7kB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,859 INFO L158 Benchmark]: Boogie Preprocessor took 286.46ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 35.9MB in the beginning and 140.2MB in the end (delta: -104.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,859 INFO L158 Benchmark]: RCFGBuilder took 1899.45ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 75.5MB in the end (delta: 64.7MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,859 INFO L158 Benchmark]: TraceAbstraction took 29475.64ms. Allocated memory was 201.3MB in the beginning and 889.2MB in the end (delta: 687.9MB). Free memory was 75.5MB in the beginning and 340.2MB in the end (delta: -264.8MB). Peak memory consumption was 535.9MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,859 INFO L158 Benchmark]: Witness Printer took 148.85ms. Allocated memory is still 889.2MB. Free memory was 340.2MB in the beginning and 315.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:58:42,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.41ms. Allocated memory is still 100.7MB. Free memory was 71.8MB in the beginning and 35.3MB in the end (delta: 36.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.13ms. Allocated memory is still 100.7MB. Free memory was 35.3MB in the beginning and 35.9MB in the end (delta: -658.7kB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 286.46ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 35.9MB in the beginning and 140.2MB in the end (delta: -104.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1899.45ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 75.5MB in the end (delta: 64.7MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29475.64ms. Allocated memory was 201.3MB in the beginning and 889.2MB in the end (delta: 687.9MB). Free memory was 75.5MB in the beginning and 340.2MB in the end (delta: -264.8MB). Peak memory consumption was 535.9MB. Max. memory is 16.1GB. * Witness Printer took 148.85ms. Allocated memory is still 889.2MB. Free memory was 340.2MB in the beginning and 315.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 155]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5241 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5241 mSDsluCounter, 7058 SdHoareTripleChecker+Invalid, 15.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 672 mSDsCounter, 3205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16096 IncrementalHoareTripleChecker+Invalid, 19301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3205 mSolverCounterUnsat, 6386 mSDtfsCounter, 16096 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1282 GetRequests, 1259 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15954occurred in iteration=17, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 13832 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 9291 NumberOfCodeBlocks, 9291 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 9271 ConstructedInterpolants, 0 QuantifiedInterpolants, 18437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1461 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 7914/8408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((long long) a0 + 99) <= 0) && (a2 == 1)) && (((long long) a4 + 86) <= 0)) || ((((long long) 42 + a4) <= 0) && (a2 == 4))) || (2 == a2)) || (((((long long) a0 + 99) <= 0) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (3 == a2)) || ((((long long) a4 + 86) <= 0) && (3 == a2))) && (a29 <= 43))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (332390 <= a0))) || ((((long long) 42 + a4) <= 0) && (5 <= a2))) || ((0 <= ((long long) 97 + a0)) && ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (3 == a2)) || ((((long long) a4 + 86) <= 0) && (3 == a2))))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (a29 <= 43))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))) || ((((long long) 89 + a4) <= 0) && (((long long) 144 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:58:42,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE