./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.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-while_file-13.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', '05a6e6e8723c5d79d8476dd5b74b6ce5ae5199b412c2ad129a20e082f5fd2cdb'] 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-while_file-13.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 05a6e6e8723c5d79d8476dd5b74b6ce5ae5199b412c2ad129a20e082f5fd2cdb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:28:05,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:28:05,559 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:28:05,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:28:05,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:28:05,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:28:05,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:28:05,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:28:05,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:28:05,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:28:05,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:28:05,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:28:05,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:28:05,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:28:05,592 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:28:05,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:28:05,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:28:05,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:28:05,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:28:05,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:28:05,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:28:05,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:28:05,594 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 -> 05a6e6e8723c5d79d8476dd5b74b6ce5ae5199b412c2ad129a20e082f5fd2cdb [2024-11-07 08:28:05,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:28:05,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:28:05,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:28:05,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:28:05,861 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:28:05,863 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-while_file-13.i [2024-11-07 08:28:07,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:28:07,284 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:28:07,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-13.i [2024-11-07 08:28:07,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fccab291d/e9ece0b49aff447fa2c24726f573458d/FLAG01f8fc97d [2024-11-07 08:28:07,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fccab291d/e9ece0b49aff447fa2c24726f573458d [2024-11-07 08:28:07,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:28:07,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:28:07,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:28:07,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:28:07,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:28:07,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aebe657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07, skipping insertion in model container [2024-11-07 08:28:07,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:28:07,444 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-while_file-13.i[915,928] [2024-11-07 08:28:07,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:28:07,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:28:07,514 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-while_file-13.i[915,928] [2024-11-07 08:28:07,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:28:07,563 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:28:07,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07 WrapperNode [2024-11-07 08:28:07,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:28:07,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:28:07,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:28:07,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:28:07,572 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:28:07" (1/1) ... [2024-11-07 08:28:07,583 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:28:07" (1/1) ... [2024-11-07 08:28:07,619 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-07 08:28:07,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:28:07,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:28:07,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:28:07,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:28:07,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,656 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:28:07,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:28:07,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:28:07,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:28:07,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:28:07,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (1/1) ... [2024-11-07 08:28:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:28:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:28:07,705 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:28:07,709 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:28:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:28:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:28:07,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:28:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:28:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:28:07,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:28:07,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:28:07,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:28:08,009 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 08:28:08,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:28:08,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:28:08,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:28:08,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:08 BoogieIcfgContainer [2024-11-07 08:28:08,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:28:08,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:28:08,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:28:08,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:28:08,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:28:07" (1/3) ... [2024-11-07 08:28:08,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37451d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:08, skipping insertion in model container [2024-11-07 08:28:08,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:28:07" (2/3) ... [2024-11-07 08:28:08,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37451d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:08, skipping insertion in model container [2024-11-07 08:28:08,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:08" (3/3) ... [2024-11-07 08:28:08,029 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-13.i [2024-11-07 08:28:08,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:28:08,040 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:28:08,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:28:08,089 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;@2b62e78d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:28:08,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:28:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:28:08,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:08,100 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:08,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1494661314, now seen corresponding path program 1 times [2024-11-07 08:28:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:08,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978513126] [2024-11-07 08:28:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978513126] [2024-11-07 08:28:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978513126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:28:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227076437] [2024-11-07 08:28:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:28:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:08,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:28:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:28:08,430 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:28:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:08,445 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-11-07 08:28:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:28:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-07 08:28:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:08,454 INFO L225 Difference]: With dead ends: 87 [2024-11-07 08:28:08,454 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 08:28:08,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:28:08,461 INFO L432 NwaCegarLoop]: 61 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, 61 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:28:08,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:28:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 08:28:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 08:28:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-11-07 08:28:08,504 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 101 [2024-11-07 08:28:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:08,505 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-11-07 08:28:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:28:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-11-07 08:28:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:28:08,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:08,509 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:08,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:28:08,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 410412862, now seen corresponding path program 1 times [2024-11-07 08:28:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370562025] [2024-11-07 08:28:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:08,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370562025] [2024-11-07 08:28:08,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370562025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:08,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:08,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:28:08,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169965485] [2024-11-07 08:28:08,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:28:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:08,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:28:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:28:08,764 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:08,806 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2024-11-07 08:28:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:28:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-11-07 08:28:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:08,811 INFO L225 Difference]: With dead ends: 113 [2024-11-07 08:28:08,811 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 08:28:08,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:28:08,814 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 54 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:08,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:28:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 08:28:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2024-11-07 08:28:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-07 08:28:08,824 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 101 [2024-11-07 08:28:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:08,825 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-07 08:28:08,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-07 08:28:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:28:08,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:08,828 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:08,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:28:08,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:08,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2109547072, now seen corresponding path program 1 times [2024-11-07 08:28:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:08,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799323206] [2024-11-07 08:28:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:08,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799323206] [2024-11-07 08:28:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799323206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:28:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491506335] [2024-11-07 08:28:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:28:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:28:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:28:09,129 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:09,146 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2024-11-07 08:28:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:28:09,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-11-07 08:28:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:09,149 INFO L225 Difference]: With dead ends: 83 [2024-11-07 08:28:09,149 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 08:28:09,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:28:09,150 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:28:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 08:28:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 08:28:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:28:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-11-07 08:28:09,157 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 101 [2024-11-07 08:28:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-11-07 08:28:09,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-11-07 08:28:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:28:09,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:28:09,159 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:28:09,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:28:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:28:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2052288770, now seen corresponding path program 1 times [2024-11-07 08:28:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:28:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063074223] [2024-11-07 08:28:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:28:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:28:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:28:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:28:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:28:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:28:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:28:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:28:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:28:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:28:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:28:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:28:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:28:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:28:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:28:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:28:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:28:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:28:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:28:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:28:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:28:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063074223] [2024-11-07 08:28:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063074223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:28:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:28:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:28:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920024914] [2024-11-07 08:28:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:28:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:28:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:28:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:28:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:28:11,176 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:28:11,426 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2024-11-07 08:28:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:28:11,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-11-07 08:28:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:28:11,428 INFO L225 Difference]: With dead ends: 68 [2024-11-07 08:28:11,428 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:28:11,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:28:11,430 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:28:11,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 333 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:28:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:28:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:28:11,432 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:28:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:28:11,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-11-07 08:28:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:28:11,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:28:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:28:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:28:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:28:11,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:28:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:28:11,438 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:28:11,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:28:11,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:28:11,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:28:11 BoogieIcfgContainer [2024-11-07 08:28:11,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:28:11,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:28:11,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:28:11,720 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:28:11,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:08" (3/4) ... [2024-11-07 08:28:11,722 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:28:11,726 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:28:11,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 08:28:11,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:28:11,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:28:11,731 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:28:11,797 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:28:11,798 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:28:11,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:28:11,799 INFO L158 Benchmark]: Toolchain (without parser) took 4486.73ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 77.4MB in the beginning and 163.7MB in the end (delta: -86.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,800 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:28:11,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.68ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 64.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.53ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 60.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,802 INFO L158 Benchmark]: Boogie Preprocessor took 52.23ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 54.2MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:28:11,802 INFO L158 Benchmark]: RCFGBuilder took 343.78ms. Allocated memory is still 100.7MB. Free memory was 54.2MB in the beginning and 74.6MB in the end (delta: -20.4MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,803 INFO L158 Benchmark]: TraceAbstraction took 3696.98ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 74.1MB in the beginning and 168.9MB in the end (delta: -94.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,803 INFO L158 Benchmark]: Witness Printer took 78.92ms. Allocated memory is still 201.3MB. Free memory was 168.9MB in the beginning and 163.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:28:11,804 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.93ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.68ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 64.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.53ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 60.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.23ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 54.2MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.78ms. Allocated memory is still 100.7MB. Free memory was 54.2MB in the beginning and 74.6MB in the end (delta: -20.4MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3696.98ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 74.1MB in the beginning and 168.9MB in the end (delta: -94.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Witness Printer took 78.92ms. Allocated memory is still 201.3MB. Free memory was 168.9MB in the beginning and 163.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 298 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 93]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && (0 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((25 <= var_1_1) && (0 <= 0)) Ensures: (((25 <= var_1_1) && (0 <= 0)) && (((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (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))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:28:11,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE