./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i --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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i', '-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', 'b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc'] 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i -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 b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:19:46,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:19:46,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:19:46,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:19:46,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:19:46,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:19:46,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:19:46,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:19:46,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:19:46,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:19:46,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:19:46,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:19:46,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:19:46,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:19:46,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:19:46,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:19:46,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:19:46,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:19:46,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:19:46,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:19:46,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:46,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:19:46,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:19:46,372 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 -> b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc [2024-11-07 08:19:46,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:19:46,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:19:46,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:19:46,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:19:46,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:19:46,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-07 08:19:48,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:19:48,257 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:19:48,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-07 08:19:48,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c791f2982/0ab1a7a963e947ccbb32f07d187887c1/FLAG0a9a6a74a [2024-11-07 08:19:48,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c791f2982/0ab1a7a963e947ccbb32f07d187887c1 [2024-11-07 08:19:48,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:19:48,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:19:48,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:48,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:19:48,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:19:48,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf85b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48, skipping insertion in model container [2024-11-07 08:19:48,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:19:48,446 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-11-07 08:19:48,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:48,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:19:48,503 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-11-07 08:19:48,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:48,535 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:19:48,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48 WrapperNode [2024-11-07 08:19:48,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:48,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:48,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:19:48,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:19:48,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,597 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-07 08:19:48,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:48,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:19:48,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:19:48,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:19:48,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,647 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-07 08:19:48,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:19:48,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:19:48,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:19:48,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:19:48,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (1/1) ... [2024-11-07 08:19:48,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:48,716 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-07 08:19:48,724 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-07 08:19:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:19:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:19:48,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:19:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:19:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:19:48,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:19:48,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:19:48,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:19:49,071 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 08:19:49,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:19:49,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:19:49,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:19:49,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:49 BoogieIcfgContainer [2024-11-07 08:19:49,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:19:49,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:19:49,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:19:49,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:19:49,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:48" (1/3) ... [2024-11-07 08:19:49,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6866f9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:49, skipping insertion in model container [2024-11-07 08:19:49,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:48" (2/3) ... [2024-11-07 08:19:49,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6866f9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:49, skipping insertion in model container [2024-11-07 08:19:49,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:49" (3/3) ... [2024-11-07 08:19:49,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-07 08:19:49,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:19:49,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:19:49,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:19:49,167 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;@43ba3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:19:49,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:19:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 08:19:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 08:19:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:49,179 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:49,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1908333502, now seen corresponding path program 1 times [2024-11-07 08:19:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61991425] [2024-11-07 08:19:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61991425] [2024-11-07 08:19:49,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61991425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:19:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598500418] [2024-11-07 08:19:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:49,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:19:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:19:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:49,503 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 08:19:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:49,526 INFO L93 Difference]: Finished difference Result 99 states and 151 transitions. [2024-11-07 08:19:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:19:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-07 08:19:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:49,536 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:19:49,536 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:19:49,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:49,542 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:49,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:19:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:19:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 08:19:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-07 08:19:49,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 65 [2024-11-07 08:19:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-07 08:19:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 08:19:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-07 08:19:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 08:19:49,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:49,590 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:19:49,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 964629886, now seen corresponding path program 1 times [2024-11-07 08:19:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027219221] [2024-11-07 08:19:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027219221] [2024-11-07 08:19:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027219221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:19:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226313850] [2024-11-07 08:19:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:19:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:19:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:19:49,965 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:50,104 INFO L93 Difference]: Finished difference Result 144 states and 194 transitions. [2024-11-07 08:19:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:19:50,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2024-11-07 08:19:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:50,107 INFO L225 Difference]: With dead ends: 144 [2024-11-07 08:19:50,107 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 08:19:50,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-07 08:19:50,109 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 83 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:50,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 157 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:19:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 08:19:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2024-11-07 08:19:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:19:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-07 08:19:50,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 65 [2024-11-07 08:19:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-07 08:19:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-07 08:19:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 08:19:50,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:50,137 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:50,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:19:50,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1961754744, now seen corresponding path program 1 times [2024-11-07 08:19:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:50,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100577335] [2024-11-07 08:19:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100577335] [2024-11-07 08:19:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100577335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:50,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:19:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949818864] [2024-11-07 08:19:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:50,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:19:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:19:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:19:50,410 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:50,578 INFO L93 Difference]: Finished difference Result 188 states and 245 transitions. [2024-11-07 08:19:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:19:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-07 08:19:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:50,582 INFO L225 Difference]: With dead ends: 188 [2024-11-07 08:19:50,582 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 08:19:50,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:19:50,584 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:50,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 237 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:19:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 08:19:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2024-11-07 08:19:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:19:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-07 08:19:50,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 69 [2024-11-07 08:19:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:50,603 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-07 08:19:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-07 08:19:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 08:19:50,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:50,605 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:19:50,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1053348874, now seen corresponding path program 1 times [2024-11-07 08:19:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233110757] [2024-11-07 08:19:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233110757] [2024-11-07 08:19:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233110757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 08:19:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062174817] [2024-11-07 08:19:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:19:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:19:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:19:54,233 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:55,559 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2024-11-07 08:19:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 08:19:55,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-07 08:19:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:55,562 INFO L225 Difference]: With dead ends: 142 [2024-11-07 08:19:55,563 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 08:19:55,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2024-11-07 08:19:55,565 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 172 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:55,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 314 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:19:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 08:19:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2024-11-07 08:19:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:19:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2024-11-07 08:19:55,586 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 69 [2024-11-07 08:19:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:55,587 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2024-11-07 08:19:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2024-11-07 08:19:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 08:19:55,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:55,589 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:55,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:19:55,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash 352284296, now seen corresponding path program 1 times [2024-11-07 08:19:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656157369] [2024-11-07 08:19:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656157369] [2024-11-07 08:19:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656157369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:19:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927169891] [2024-11-07 08:19:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:56,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:19:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:19:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:19:56,170 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:56,403 INFO L93 Difference]: Finished difference Result 256 states and 326 transitions. [2024-11-07 08:19:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:19:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-07 08:19:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:56,406 INFO L225 Difference]: With dead ends: 256 [2024-11-07 08:19:56,406 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 08:19:56,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:19:56,407 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:56,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 244 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:19:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 08:19:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 127. [2024-11-07 08:19:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 99 states have internal predecessors, (115), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:19:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2024-11-07 08:19:56,423 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 69 [2024-11-07 08:19:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:56,423 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2024-11-07 08:19:56,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2024-11-07 08:19:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 08:19:56,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:56,426 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:19:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:19:56,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1135367853, now seen corresponding path program 1 times [2024-11-07 08:19:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672453437] [2024-11-07 08:19:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:19:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672453437] [2024-11-07 08:19:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672453437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:58,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:19:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040917845] [2024-11-07 08:19:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:58,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:19:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:19:58,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:19:58,294 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:59,393 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2024-11-07 08:19:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:19:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-11-07 08:19:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:59,395 INFO L225 Difference]: With dead ends: 162 [2024-11-07 08:19:59,395 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 08:19:59,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:19:59,396 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 133 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:59,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 290 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:19:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 08:19:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-11-07 08:19:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 108 states have internal predecessors, (126), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:19:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2024-11-07 08:19:59,411 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 70 [2024-11-07 08:19:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:59,411 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2024-11-07 08:19:59,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 08:19:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2024-11-07 08:19:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 08:19:59,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:59,414 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:19:59,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:19:59,414 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash -196562412, now seen corresponding path program 1 times [2024-11-07 08:19:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481799115] [2024-11-07 08:19:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:19:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:19:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:19:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 08:19:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:19:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 08:19:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 08:19:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 08:19:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 08:19:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 08:19:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:19:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:19:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481799115] [2024-11-07 08:19:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481799115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:19:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484709341] [2024-11-07 08:19:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:59,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:59,555 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-07 08:19:59,556 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-07 08:19:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:59,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:19:59,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-07 08:19:59,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:19:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484709341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:19:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-07 08:19:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189589278] [2024-11-07 08:19:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:19:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:19:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:19:59,698 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:19:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:59,723 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2024-11-07 08:19:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:19:59,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2024-11-07 08:19:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:59,726 INFO L225 Difference]: With dead ends: 140 [2024-11-07 08:19:59,726 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 08:19:59,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:19:59,727 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:59,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 08:19:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-07 08:19:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:19:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2024-11-07 08:19:59,748 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 134 [2024-11-07 08:19:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:59,748 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2024-11-07 08:19:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:19:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2024-11-07 08:19:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 08:19:59,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:59,751 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 08:19:59,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:19:59,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:59,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 433843283, now seen corresponding path program 1 times [2024-11-07 08:19:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580177506] [2024-11-07 08:19:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:20:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:20:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:20:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:20:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:20:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 08:20:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:20:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:20:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:20:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:20:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:20:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:20:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580177506] [2024-11-07 08:20:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580177506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:20:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24410441] [2024-11-07 08:20:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:00,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:00,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:00,095 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-07 08:20:00,096 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-07 08:20:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:00,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 08:20:00,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-07 08:20:00,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24410441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:20:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-07 08:20:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070088292] [2024-11-07 08:20:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:20:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:20:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:20:00,290 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:20:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:00,322 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-11-07 08:20:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:20:00,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-11-07 08:20:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:00,323 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:20:00,323 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:20:00,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-07 08:20:00,324 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:00,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:20:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:20:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:20:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:20:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:20:00,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-11-07 08:20:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:00,326 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:20:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:20:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:20:00,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:20:00,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:20:00,348 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-07 08:20:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:00,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:20:00,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:20:00,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:20:00,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:20:00 BoogieIcfgContainer [2024-11-07 08:20:00,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:20:00,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:20:00,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:20:00,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:20:00,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:49" (3/4) ... [2024-11-07 08:20:00,871 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:20:00,877 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:20:00,883 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 08:20:00,884 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:20:00,884 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:20:00,884 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:20:00,960 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:20:00,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:20:00,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:20:00,961 INFO L158 Benchmark]: Toolchain (without parser) took 12672.20ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 77.3MB in the beginning and 107.9MB in the end (delta: -30.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-11-07 08:20:00,962 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:00,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:20:00,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.30ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:20:00,963 INFO L158 Benchmark]: Boogie Preprocessor took 73.85ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 60.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:00,963 INFO L158 Benchmark]: RCFGBuilder took 403.91ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 45.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:20:00,964 INFO L158 Benchmark]: TraceAbstraction took 11784.95ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 44.4MB in the beginning and 113.9MB in the end (delta: -69.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-07 08:20:00,964 INFO L158 Benchmark]: Witness Printer took 92.68ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 107.9MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:00,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.30ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.85ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 60.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 403.91ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 45.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11784.95ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 44.4MB in the beginning and 113.9MB in the end (delta: -69.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Witness Printer took 92.68ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 107.9MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 1499 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 422 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 4874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2714/2716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: ((((((((((0 <= 0) && (1 <= k_loop)) && (50 <= last_1_var_1_9)) && (var_1_8 == var_1_18)) && ((((128 + (65534 * last_1_var_1_7)) == (var_1_1 + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && ((((last_1_var_1_7 * 32767) + 64) % 32768) <= 16383)) || (((65534 * last_1_var_1_7) == ((65408 + var_1_1) + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && (16384 <= (((last_1_var_1_7 * 32767) + 64) % 32768))))) && (var_1_17 == var_1_16)) && (var_1_7 == var_1_8)) && (50 <= var_1_9)) && (var_1_8 <= ((short) var_1_8 + var_1_18))) || (((((200 == var_1_7) && (50 <= last_1_var_1_9)) && (0 <= k_loop)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((200 == var_1_7) && (50 <= last_1_var_1_9)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9)) Ensures: (((((200 == var_1_7) && (50 <= last_1_var_1_9)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_9 == \old(last_1_var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:20:01,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE