./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem13_label16.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', '8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label16.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 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:47:25,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:47:26,042 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:47:26,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:47:26,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:47:26,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:47:26,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:47:26,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:47:26,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:47:26,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:47:26,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:47:26,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:47:26,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:47:26,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:47:26,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:47:26,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:47:26,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:47:26,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:47:26,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:26,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:47:26,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:47:26,078 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 -> 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 [2024-11-06 19:47:26,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:47:26,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:47:26,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:47:26,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:47:26,416 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:47:26,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2024-11-06 19:47:27,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:47:28,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:47:28,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2024-11-06 19:47:28,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f84bd2eb/533b4aa18d504942813539bff2932566/FLAG705c2e41e [2024-11-06 19:47:28,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f84bd2eb/533b4aa18d504942813539bff2932566 [2024-11-06 19:47:28,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:47:28,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:47:28,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:28,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:47:28,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:47:28,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:28" (1/1) ... [2024-11-06 19:47:28,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14be0625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:28, skipping insertion in model container [2024-11-06 19:47:28,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:28" (1/1) ... [2024-11-06 19:47:28,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:47:28,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c[3388,3401] [2024-11-06 19:47:29,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:29,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:47:29,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c[3388,3401] [2024-11-06 19:47:29,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:29,861 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:47:29,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29 WrapperNode [2024-11-06 19:47:29,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:29,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:29,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:47:29,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:47:29,870 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:47:29" (1/1) ... [2024-11-06 19:47:29,932 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:47:29" (1/1) ... [2024-11-06 19:47:30,578 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:47:30,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:30,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:47:30,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:47:30,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:47:30,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:30,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:30,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:30,925 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:47:30,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:30,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:47:31,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:47:31,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:47:31,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:47:31,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2024-11-06 19:47:31,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:47:31,403 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:47:31,406 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:47:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:47:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:47:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:47:31,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:47:31,532 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:47:31,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:47:37,373 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:47:37,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:47:37,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:47:37,490 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:47:37,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:37 BoogieIcfgContainer [2024-11-06 19:47:37,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:47:37,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:47:37,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:47:37,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:47:37,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:47:28" (1/3) ... [2024-11-06 19:47:37,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acf8505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:37, skipping insertion in model container [2024-11-06 19:47:37,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (2/3) ... [2024-11-06 19:47:37,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acf8505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:37, skipping insertion in model container [2024-11-06 19:47:37,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:37" (3/3) ... [2024-11-06 19:47:37,502 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label16.c [2024-11-06 19:47:37,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:47:37,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:47:37,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:47:37,611 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;@65122a68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:47:37,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:47:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 19:47:37,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:37,629 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] [2024-11-06 19:47:37,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:37,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2024-11-06 19:47:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278702228] [2024-11-06 19:47:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:37,871 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:47:37,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278702228] [2024-11-06 19:47:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278702228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:37,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568844351] [2024-11-06 19:47:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:37,906 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:41,545 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-06 19:47:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-06 19:47:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:41,574 INFO L225 Difference]: With dead ends: 3035 [2024-11-06 19:47:41,575 INFO L226 Difference]: Without dead ends: 1873 [2024-11-06 19:47:41,588 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:47:41,592 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 883 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:41,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:47:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-06 19:47:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-06 19:47:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-06 19:47:41,717 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 22 [2024-11-06 19:47:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-06 19:47:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-06 19:47:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-06 19:47:41,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:41,723 INFO L215 NwaCegarLoop]: trace histogram [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:47:41,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:47:41,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:41,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 209102453, now seen corresponding path program 1 times [2024-11-06 19:47:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676601592] [2024-11-06 19:47:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676601592] [2024-11-06 19:47:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676601592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404002860] [2024-11-06 19:47:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:42,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:42,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:42,104 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:45,554 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-06 19:47:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-06 19:47:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:45,567 INFO L225 Difference]: With dead ends: 5317 [2024-11-06 19:47:45,567 INFO L226 Difference]: Without dead ends: 3460 [2024-11-06 19:47:45,570 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:47:45,571 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:45,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:47:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-06 19:47:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-06 19:47:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-06 19:47:45,649 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 94 [2024-11-06 19:47:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:45,651 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-06 19:47:45,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-06 19:47:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 19:47:45,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:45,656 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:47:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:47:45,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 169265708, now seen corresponding path program 1 times [2024-11-06 19:47:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968782248] [2024-11-06 19:47:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968782248] [2024-11-06 19:47:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968782248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173145063] [2024-11-06 19:47:46,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:47:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:47:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:47:46,097 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:50,607 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-06 19:47:50,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:47:50,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-06 19:47:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:50,635 INFO L225 Difference]: With dead ends: 10870 [2024-11-06 19:47:50,635 INFO L226 Difference]: Without dead ends: 7413 [2024-11-06 19:47:50,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:47:50,642 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 2582 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:50,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1003 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-06 19:47:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-06 19:47:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-06 19:47:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2698691134799622) internal successors, (9411), 7411 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9411 transitions. [2024-11-06 19:47:50,766 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9411 transitions. Word has length 108 [2024-11-06 19:47:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:50,767 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9411 transitions. [2024-11-06 19:47:50,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9411 transitions. [2024-11-06 19:47:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-06 19:47:50,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:50,774 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:47:50,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:47:50,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:50,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 500012194, now seen corresponding path program 1 times [2024-11-06 19:47:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066684239] [2024-11-06 19:47:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:47:51,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066684239] [2024-11-06 19:47:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066684239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:51,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336621973] [2024-11-06 19:47:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:51,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:51,066 INFO L87 Difference]: Start difference. First operand 7412 states and 9411 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:54,211 INFO L93 Difference]: Finished difference Result 20355 states and 26251 transitions. [2024-11-06 19:47:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 189 [2024-11-06 19:47:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:54,243 INFO L225 Difference]: With dead ends: 20355 [2024-11-06 19:47:54,243 INFO L226 Difference]: Without dead ends: 13732 [2024-11-06 19:47:54,253 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:47:54,253 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 888 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:54,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 978 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:47:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2024-11-06 19:47:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 12937. [2024-11-06 19:47:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.215213358070501) internal successors, (15720), 12936 states have internal predecessors, (15720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 15720 transitions. [2024-11-06 19:47:54,470 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 15720 transitions. Word has length 189 [2024-11-06 19:47:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:54,471 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 15720 transitions. [2024-11-06 19:47:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 15720 transitions. [2024-11-06 19:47:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-06 19:47:54,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:54,476 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:47:54,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1787709102, now seen corresponding path program 1 times [2024-11-06 19:47:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11814596] [2024-11-06 19:47:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:54,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11814596] [2024-11-06 19:47:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11814596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:54,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551848563] [2024-11-06 19:47:54,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:54,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:54,706 INFO L87 Difference]: Start difference. First operand 12937 states and 15720 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:58,058 INFO L93 Difference]: Finished difference Result 31392 states and 39119 transitions. [2024-11-06 19:47:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-06 19:47:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:58,100 INFO L225 Difference]: With dead ends: 31392 [2024-11-06 19:47:58,100 INFO L226 Difference]: Without dead ends: 19244 [2024-11-06 19:47:58,113 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:47:58,114 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:58,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 926 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:47:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2024-11-06 19:47:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 18447. [2024-11-06 19:47:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18447 states, 18446 states have (on average 1.2024287108316165) internal successors, (22180), 18446 states have internal predecessors, (22180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 22180 transitions. [2024-11-06 19:47:58,457 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 22180 transitions. Word has length 221 [2024-11-06 19:47:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:58,458 INFO L471 AbstractCegarLoop]: Abstraction has 18447 states and 22180 transitions. [2024-11-06 19:47:58,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 22180 transitions. [2024-11-06 19:47:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-06 19:47:58,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:58,470 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:58,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:47:58,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:58,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash 947672488, now seen corresponding path program 1 times [2024-11-06 19:47:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:58,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383052676] [2024-11-06 19:47:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:47:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383052676] [2024-11-06 19:47:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383052676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273243157] [2024-11-06 19:47:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:58,930 INFO L87 Difference]: Start difference. First operand 18447 states and 22180 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 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:48:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:02,557 INFO L93 Difference]: Finished difference Result 52772 states and 63784 transitions. [2024-11-06 19:48:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 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 310 [2024-11-06 19:48:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:02,618 INFO L225 Difference]: With dead ends: 52772 [2024-11-06 19:48:02,620 INFO L226 Difference]: Without dead ends: 35114 [2024-11-06 19:48:02,636 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:48:02,637 INFO L432 NwaCegarLoop]: 1700 mSDtfsCounter, 951 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:02,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1819 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 3128 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:48:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35114 states. [2024-11-06 19:48:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35114 to 34274. [2024-11-06 19:48:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34274 states, 34273 states have (on average 1.1858897674554314) internal successors, (40644), 34273 states have internal predecessors, (40644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34274 states to 34274 states and 40644 transitions. [2024-11-06 19:48:03,033 INFO L78 Accepts]: Start accepts. Automaton has 34274 states and 40644 transitions. Word has length 310 [2024-11-06 19:48:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 34274 states and 40644 transitions. [2024-11-06 19:48:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 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:48:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34274 states and 40644 transitions. [2024-11-06 19:48:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-06 19:48:03,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:03,040 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:03,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:48:03,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:03,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1734427868, now seen corresponding path program 1 times [2024-11-06 19:48:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:03,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992526939] [2024-11-06 19:48:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 19:48:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992526939] [2024-11-06 19:48:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992526939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791371944] [2024-11-06 19:48:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:03,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:48:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:48:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:03,336 INFO L87 Difference]: Start difference. First operand 34274 states and 40644 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:09,692 INFO L93 Difference]: Finished difference Result 108144 states and 129355 transitions. [2024-11-06 19:48:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:48:09,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 310 [2024-11-06 19:48:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:09,811 INFO L225 Difference]: With dead ends: 108144 [2024-11-06 19:48:09,812 INFO L226 Difference]: Without dead ends: 74659 [2024-11-06 19:48:09,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:09,841 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 1727 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 6796 mSolverCounterSat, 1085 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 7881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1085 IncrementalHoareTripleChecker+Valid, 6796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:09,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 846 Invalid, 7881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1085 Valid, 6796 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-06 19:48:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74659 states. [2024-11-06 19:48:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74659 to 74498. [2024-11-06 19:48:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74498 states, 74497 states have (on average 1.170892787629032) internal successors, (87228), 74497 states have internal predecessors, (87228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74498 states to 74498 states and 87228 transitions. [2024-11-06 19:48:10,746 INFO L78 Accepts]: Start accepts. Automaton has 74498 states and 87228 transitions. Word has length 310 [2024-11-06 19:48:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 74498 states and 87228 transitions. [2024-11-06 19:48:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 74498 states and 87228 transitions. [2024-11-06 19:48:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-06 19:48:10,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:10,754 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:48:10,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:48:10,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2097221119, now seen corresponding path program 1 times [2024-11-06 19:48:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109835177] [2024-11-06 19:48:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-06 19:48:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:11,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109835177] [2024-11-06 19:48:11,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109835177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:11,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:11,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:11,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185001552] [2024-11-06 19:48:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:11,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:11,131 INFO L87 Difference]: Start difference. First operand 74498 states and 87228 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:14,667 INFO L93 Difference]: Finished difference Result 160034 states and 187017 transitions. [2024-11-06 19:48:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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 348 [2024-11-06 19:48:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:14,795 INFO L225 Difference]: With dead ends: 160034 [2024-11-06 19:48:14,795 INFO L226 Difference]: Without dead ends: 86325 [2024-11-06 19:48:14,848 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:48:14,849 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:14,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1201 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:48:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86325 states. [2024-11-06 19:48:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86325 to 86316. [2024-11-06 19:48:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86316 states, 86315 states have (on average 1.1568672884203208) internal successors, (99855), 86315 states have internal predecessors, (99855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86316 states to 86316 states and 99855 transitions. [2024-11-06 19:48:15,970 INFO L78 Accepts]: Start accepts. Automaton has 86316 states and 99855 transitions. Word has length 348 [2024-11-06 19:48:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:15,970 INFO L471 AbstractCegarLoop]: Abstraction has 86316 states and 99855 transitions. [2024-11-06 19:48:15,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 86316 states and 99855 transitions. [2024-11-06 19:48:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-06 19:48:15,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:15,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:48:15,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:15,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2065811671, now seen corresponding path program 1 times [2024-11-06 19:48:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618301302] [2024-11-06 19:48:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 262 proven. 113 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 19:48:17,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618301302] [2024-11-06 19:48:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618301302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727966823] [2024-11-06 19:48:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:17,700 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:48:17,701 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:48:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:17,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:48:17,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-06 19:48:18,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727966823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:18,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:48:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905987148] [2024-11-06 19:48:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:18,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:18,145 INFO L87 Difference]: Start difference. First operand 86316 states and 99855 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:21,449 INFO L93 Difference]: Finished difference Result 171840 states and 198914 transitions. [2024-11-06 19:48:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 377 [2024-11-06 19:48:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:21,544 INFO L225 Difference]: With dead ends: 171840 [2024-11-06 19:48:21,545 INFO L226 Difference]: Without dead ends: 86313 [2024-11-06 19:48:21,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:21,592 INFO L432 NwaCegarLoop]: 1364 mSDtfsCounter, 1094 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:21,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1446 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:48:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86313 states. [2024-11-06 19:48:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86313 to 86311. [2024-11-06 19:48:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86311 states, 86310 states have (on average 1.1199397520565404) internal successors, (96662), 86310 states have internal predecessors, (96662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86311 states to 86311 states and 96662 transitions. [2024-11-06 19:48:22,424 INFO L78 Accepts]: Start accepts. Automaton has 86311 states and 96662 transitions. Word has length 377 [2024-11-06 19:48:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:22,425 INFO L471 AbstractCegarLoop]: Abstraction has 86311 states and 96662 transitions. [2024-11-06 19:48:22,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 86311 states and 96662 transitions. [2024-11-06 19:48:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-06 19:48:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:22,430 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:22,449 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:48:22,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:22,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:22,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2022662319, now seen corresponding path program 1 times [2024-11-06 19:48:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584425148] [2024-11-06 19:48:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-06 19:48:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584425148] [2024-11-06 19:48:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584425148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408934820] [2024-11-06 19:48:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:23,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:23,023 INFO L87 Difference]: Start difference. First operand 86311 states and 96662 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:26,682 INFO L93 Difference]: Finished difference Result 198608 states and 224799 transitions. [2024-11-06 19:48:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 378 [2024-11-06 19:48:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:26,797 INFO L225 Difference]: With dead ends: 198608 [2024-11-06 19:48:26,797 INFO L226 Difference]: Without dead ends: 113086 [2024-11-06 19:48:26,843 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:48:26,844 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 899 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 946 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:26,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 913 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [946 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:48:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113086 states. [2024-11-06 19:48:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113086 to 111491. [2024-11-06 19:48:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111491 states, 111490 states have (on average 1.1249977576464256) internal successors, (125426), 111490 states have internal predecessors, (125426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111491 states to 111491 states and 125426 transitions. [2024-11-06 19:48:28,146 INFO L78 Accepts]: Start accepts. Automaton has 111491 states and 125426 transitions. Word has length 378 [2024-11-06 19:48:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:28,146 INFO L471 AbstractCegarLoop]: Abstraction has 111491 states and 125426 transitions. [2024-11-06 19:48:28,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 111491 states and 125426 transitions. [2024-11-06 19:48:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-06 19:48:28,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:28,157 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:28,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:48:28,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:28,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -351823286, now seen corresponding path program 1 times [2024-11-06 19:48:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139112168] [2024-11-06 19:48:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 277 proven. 113 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 19:48:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139112168] [2024-11-06 19:48:29,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139112168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035511250] [2024-11-06 19:48:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:29,748 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:48:29,753 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:48:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:29,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:48:29,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:48:30,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035511250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:48:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136756536] [2024-11-06 19:48:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:30,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:30,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:30,133 INFO L87 Difference]: Start difference. First operand 111491 states and 125426 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:33,498 INFO L93 Difference]: Finished difference Result 217428 states and 246761 transitions. [2024-11-06 19:48:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 452 [2024-11-06 19:48:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:33,643 INFO L225 Difference]: With dead ends: 217428 [2024-11-06 19:48:33,644 INFO L226 Difference]: Without dead ends: 122475 [2024-11-06 19:48:33,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:33,718 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1138 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:33,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 411 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:48:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122475 states. [2024-11-06 19:48:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122475 to 122473. [2024-11-06 19:48:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122473 states, 122472 states have (on average 1.1164102815337382) internal successors, (136729), 122472 states have internal predecessors, (136729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122473 states to 122473 states and 136729 transitions. [2024-11-06 19:48:35,016 INFO L78 Accepts]: Start accepts. Automaton has 122473 states and 136729 transitions. Word has length 452 [2024-11-06 19:48:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:35,016 INFO L471 AbstractCegarLoop]: Abstraction has 122473 states and 136729 transitions. [2024-11-06 19:48:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 122473 states and 136729 transitions. [2024-11-06 19:48:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-06 19:48:35,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:35,025 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:35,037 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:48:35,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:35,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash -361499736, now seen corresponding path program 1 times [2024-11-06 19:48:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374760282] [2024-11-06 19:48:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:48:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374760282] [2024-11-06 19:48:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374760282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660261160] [2024-11-06 19:48:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:35,698 INFO L87 Difference]: Start difference. First operand 122473 states and 136729 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:39,219 INFO L93 Difference]: Finished difference Result 266986 states and 299855 transitions. [2024-11-06 19:48:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 470 [2024-11-06 19:48:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:39,404 INFO L225 Difference]: With dead ends: 266986 [2024-11-06 19:48:39,404 INFO L226 Difference]: Without dead ends: 145302 [2024-11-06 19:48:39,461 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:48:39,462 INFO L432 NwaCegarLoop]: 1755 mSDtfsCounter, 723 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:39,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1899 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:48:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145302 states. [2024-11-06 19:48:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145302 to 141346. [2024-11-06 19:48:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141346 states, 141345 states have (on average 1.101213343238176) internal successors, (155651), 141345 states have internal predecessors, (155651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141346 states to 141346 states and 155651 transitions. [2024-11-06 19:48:40,913 INFO L78 Accepts]: Start accepts. Automaton has 141346 states and 155651 transitions. Word has length 470 [2024-11-06 19:48:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:40,913 INFO L471 AbstractCegarLoop]: Abstraction has 141346 states and 155651 transitions. [2024-11-06 19:48:40,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 141346 states and 155651 transitions. [2024-11-06 19:48:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-11-06 19:48:40,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:40,932 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:48:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:48:40,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1002493065, now seen corresponding path program 1 times [2024-11-06 19:48:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179736563] [2024-11-06 19:48:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 351 proven. 110 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 19:48:42,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179736563] [2024-11-06 19:48:42,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179736563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735557307] [2024-11-06 19:48:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:42,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:42,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:48:42,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:48:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:42,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:48:42,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-06 19:48:43,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735557307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-06 19:48:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137256614] [2024-11-06 19:48:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:43,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:48:43,716 INFO L87 Difference]: Start difference. First operand 141346 states and 155651 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)