./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/shared_mem2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 0f2b1437458922f937e4f63e8c97355790d0c2b77a3c021e76d395c8c90c4257 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:55:15,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:55:15,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:55:15,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:55:15,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:55:15,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:55:15,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:55:15,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:55:15,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:55:15,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:55:15,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:55:15,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:55:15,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:55:15,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:55:15,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:55:15,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:55:15,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:55:15,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:55:15,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:55:15,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:55:15,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:55:15,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:55:15,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:55:15,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:55:15,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:55:15,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:55:15,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:55:15,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:55:15,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:55:15,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:55:15,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:55:15,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:55:15,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:55:15,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:55:15,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:55:15,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:55:15,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:55:15,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:55:15,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:55:15,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:55:15,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:55:15,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:55:15,202 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:55:15,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:55:15,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:55:15,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:55:15,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:55:15,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:55:15,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:55:15,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:55:15,205 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:55:15,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:55:15,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:55:15,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:55:15,207 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:55:15,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:55:15,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:55:15,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:55:15,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:55:15,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:55:15,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:55:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:55:15,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:55:15,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:55:15,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:55:15,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:55:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:55:15,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:55:15,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:55:15,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:55:15,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0f2b1437458922f937e4f63e8c97355790d0c2b77a3c021e76d395c8c90c4257 [2021-12-27 23:55:15,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:55:15,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:55:15,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:55:15,525 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:55:15,526 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:55:15,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem2.i [2021-12-27 23:55:15,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c93acd/82d22faa748e4d9598a9189e13895f2c/FLAG93c4edcf2 [2021-12-27 23:55:15,907 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:55:15,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem2.i [2021-12-27 23:55:15,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c93acd/82d22faa748e4d9598a9189e13895f2c/FLAG93c4edcf2 [2021-12-27 23:55:16,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c93acd/82d22faa748e4d9598a9189e13895f2c [2021-12-27 23:55:16,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:55:16,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:55:16,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:55:16,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:55:16,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:55:16,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad1f2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16, skipping insertion in model container [2021-12-27 23:55:16,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:55:16,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:55:16,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem2.i[23827,23840] [2021-12-27 23:55:16,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:55:16,625 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:55:16,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem2.i[23827,23840] [2021-12-27 23:55:16,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:55:16,670 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:55:16,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16 WrapperNode [2021-12-27 23:55:16,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:55:16,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:55:16,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:55:16,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:55:16,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,711 INFO L137 Inliner]: procedures = 121, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2021-12-27 23:55:16,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:55:16,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:55:16,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:55:16,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:55:16,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:55:16,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:55:16,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:55:16,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:55:16,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (1/1) ... [2021-12-27 23:55:16,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:55:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:16,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 23:55:16,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 23:55:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:55:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:55:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:55:16,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:55:16,864 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:55:16,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:55:17,081 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:55:17,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:55:17,085 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 23:55:17,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:55:17 BoogieIcfgContainer [2021-12-27 23:55:17,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:55:17,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:55:17,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:55:17,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:55:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:55:16" (1/3) ... [2021-12-27 23:55:17,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:55:17, skipping insertion in model container [2021-12-27 23:55:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:55:16" (2/3) ... [2021-12-27 23:55:17,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:55:17, skipping insertion in model container [2021-12-27 23:55:17,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:55:17" (3/3) ... [2021-12-27 23:55:17,090 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2021-12-27 23:55:17,094 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:55:17,094 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:55:17,162 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:55:17,166 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:55:17,166 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:55:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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) [2021-12-27 23:55:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-27 23:55:17,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:17,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:17,192 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash 561717608, now seen corresponding path program 1 times [2021-12-27 23:55:17,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:17,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853012875] [2021-12-27 23:55:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:17,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:17,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:17,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853012875] [2021-12-27 23:55:17,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853012875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:55:17,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:55:17,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:55:17,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876979850] [2021-12-27 23:55:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:55:17,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:55:17,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:55:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:55:17,405 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-12-27 23:55:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:17,416 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-27 23:55:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:55:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-27 23:55:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:17,424 INFO L225 Difference]: With dead ends: 29 [2021-12-27 23:55:17,424 INFO L226 Difference]: Without dead ends: 14 [2021-12-27 23:55:17,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:55:17,430 INFO L933 BasicCegarLoop]: 20 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, 20 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 [2021-12-27 23:55:17,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:55:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-27 23:55:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-27 23:55:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-12-27 23:55:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-12-27 23:55:17,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2021-12-27 23:55:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:17,452 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-12-27 23:55:17,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-12-27 23:55:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-12-27 23:55:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-27 23:55:17,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:17,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:17,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:55:17,454 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash -861307399, now seen corresponding path program 1 times [2021-12-27 23:55:17,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:17,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579907306] [2021-12-27 23:55:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:17,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:17,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579907306] [2021-12-27 23:55:17,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579907306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:55:17,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:55:17,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:55:17,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242874012] [2021-12-27 23:55:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:55:17,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:55:17,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:55:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:55:17,600 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-12-27 23:55:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:17,666 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2021-12-27 23:55:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:55:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-27 23:55:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:17,668 INFO L225 Difference]: With dead ends: 26 [2021-12-27 23:55:17,668 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:55:17,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:55:17,672 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:17,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:55:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:55:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:55:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-27 23:55:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2021-12-27 23:55:17,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2021-12-27 23:55:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:17,681 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-27 23:55:17,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-12-27 23:55:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2021-12-27 23:55:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-27 23:55:17,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:17,684 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:17,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:55:17,685 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 909226845, now seen corresponding path program 1 times [2021-12-27 23:55:17,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:17,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048462711] [2021-12-27 23:55:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:17,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:17,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:17,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048462711] [2021-12-27 23:55:17,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048462711] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:55:17,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960091027] [2021-12-27 23:55:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:17,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:17,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:17,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:55:17,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 23:55:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:17,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-27 23:55:17,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:55:18,024 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-27 23:55:18,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-27 23:55:18,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-27 23:55:18,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-27 23:55:18,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:18,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:18,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2021-12-27 23:55:18,136 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-27 23:55:18,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-27 23:55:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:18,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:55:18,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_3| Int) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_181) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_3|) 0)) (< .cse0 100) (= .cse0 100)))) is different from false [2021-12-27 23:55:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-27 23:55:18,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960091027] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:55:18,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:55:18,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2021-12-27 23:55:18,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988071800] [2021-12-27 23:55:18,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:55:18,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-27 23:55:18,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-27 23:55:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2021-12-27 23:55:18,305 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-12-27 23:55:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:18,445 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2021-12-27 23:55:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:55:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-27 23:55:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:18,447 INFO L225 Difference]: With dead ends: 38 [2021-12-27 23:55:18,447 INFO L226 Difference]: Without dead ends: 34 [2021-12-27 23:55:18,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=151, Unknown=1, NotChecked=26, Total=240 [2021-12-27 23:55:18,448 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:18,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2021-12-27 23:55:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-27 23:55:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2021-12-27 23:55:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:55:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-27 23:55:18,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2021-12-27 23:55:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:18,453 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-27 23:55:18,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2021-12-27 23:55:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-27 23:55:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 23:55:18,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:18,454 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:18,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 23:55:18,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:18,654 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1525342480, now seen corresponding path program 1 times [2021-12-27 23:55:18,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:18,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935642950] [2021-12-27 23:55:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:18,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:18,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935642950] [2021-12-27 23:55:18,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935642950] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:55:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835763869] [2021-12-27 23:55:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:18,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:18,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:18,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:55:18,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 23:55:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-27 23:55:18,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:55:18,873 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-27 23:55:18,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:18,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:18,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:18,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 59 [2021-12-27 23:55:18,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2021-12-27 23:55:19,013 INFO L353 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2021-12-27 23:55:19,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2021-12-27 23:55:19,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-27 23:55:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:19,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:55:19,256 INFO L353 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2021-12-27 23:55:19,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2021-12-27 23:55:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:19,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835763869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:55:19,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:55:19,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2021-12-27 23:55:19,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101124043] [2021-12-27 23:55:19,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:55:19,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 23:55:19,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 23:55:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-12-27 23:55:19,415 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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) [2021-12-27 23:55:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:19,732 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2021-12-27 23:55:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:55:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-27 23:55:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:19,733 INFO L225 Difference]: With dead ends: 41 [2021-12-27 23:55:19,733 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:55:19,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2021-12-27 23:55:19,734 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:19,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2021-12-27 23:55:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:55:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-12-27 23:55:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-27 23:55:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-27 23:55:19,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 14 [2021-12-27 23:55:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:19,738 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-27 23:55:19,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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) [2021-12-27 23:55:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2021-12-27 23:55:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-27 23:55:19,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:19,739 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 23:55:19,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-27 23:55:19,947 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1328429964, now seen corresponding path program 1 times [2021-12-27 23:55:19,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:19,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672517683] [2021-12-27 23:55:19,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:19,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:20,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:20,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672517683] [2021-12-27 23:55:20,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672517683] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:55:20,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824235250] [2021-12-27 23:55:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:20,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:20,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:55:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 23:55:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:20,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-27 23:55:20,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:55:20,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:20,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:20,267 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-27 23:55:20,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-27 23:55:20,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-27 23:55:20,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-27 23:55:20,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-27 23:55:20,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:20,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-27 23:55:20,353 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:55:20,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:55:20,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 59 [2021-12-27 23:55:20,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2021-12-27 23:55:20,462 INFO L353 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2021-12-27 23:55:20,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2021-12-27 23:55:20,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-27 23:55:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:20,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:55:20,746 INFO L353 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2021-12-27 23:55:20,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2021-12-27 23:55:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:21,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824235250] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:55:21,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:55:21,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2021-12-27 23:55:21,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927262959] [2021-12-27 23:55:21,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:55:21,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-27 23:55:21,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-27 23:55:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-12-27 23:55:21,122 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:55:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:21,562 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2021-12-27 23:55:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:55:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-27 23:55:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:21,563 INFO L225 Difference]: With dead ends: 46 [2021-12-27 23:55:21,563 INFO L226 Difference]: Without dead ends: 34 [2021-12-27 23:55:21,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-12-27 23:55:21,564 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:21,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 79 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 90 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2021-12-27 23:55:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-27 23:55:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2021-12-27 23:55:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2021-12-27 23:55:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-27 23:55:21,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2021-12-27 23:55:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:21,568 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-27 23:55:21,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:55:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-27 23:55:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:55:21,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:21,569 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:21,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:55:21,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:21,784 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1426514087, now seen corresponding path program 2 times [2021-12-27 23:55:21,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766834208] [2021-12-27 23:55:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:21,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:22,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766834208] [2021-12-27 23:55:22,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766834208] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:55:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837947711] [2021-12-27 23:55:22,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:55:22,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:22,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:55:22,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-27 23:55:22,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:55:22,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:55:22,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-27 23:55:22,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:55:22,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:22,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:22,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-27 23:55:22,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:22,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:22,414 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-27 23:55:22,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2021-12-27 23:55:22,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-27 23:55:22,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2021-12-27 23:55:22,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2021-12-27 23:55:22,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-27 23:55:22,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-27 23:55:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:55:22,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:55:22,742 INFO L353 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2021-12-27 23:55:22,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 140 [2021-12-27 23:55:23,013 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.base| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_493))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_492) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4)))))) is different from false [2021-12-27 23:55:23,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_492)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4)))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.base| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_493))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_492) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) 4)))))) is different from false [2021-12-27 23:55:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-27 23:55:23,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837947711] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:55:23,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:55:23,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 23 [2021-12-27 23:55:23,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239945854] [2021-12-27 23:55:23,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:55:23,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-27 23:55:23,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-27 23:55:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=356, Unknown=2, NotChecked=78, Total=506 [2021-12-27 23:55:23,056 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 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) [2021-12-27 23:55:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:23,887 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2021-12-27 23:55:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-27 23:55:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-27 23:55:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:23,888 INFO L225 Difference]: With dead ends: 53 [2021-12-27 23:55:23,888 INFO L226 Difference]: Without dead ends: 49 [2021-12-27 23:55:23,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=780, Unknown=2, NotChecked=122, Total=1122 [2021-12-27 23:55:23,889 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:23,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 143 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 127 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2021-12-27 23:55:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-27 23:55:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2021-12-27 23:55:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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) [2021-12-27 23:55:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-27 23:55:23,894 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2021-12-27 23:55:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:23,894 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-27 23:55:23,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 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) [2021-12-27 23:55:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-27 23:55:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:55:23,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:55:23,895 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:55:23,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-27 23:55:24,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:24,111 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:55:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:55:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -867864053, now seen corresponding path program 2 times [2021-12-27 23:55:24,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:55:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125197412] [2021-12-27 23:55:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:55:24,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:55:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:55:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:24,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:55:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125197412] [2021-12-27 23:55:24,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125197412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:55:24,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982489987] [2021-12-27 23:55:24,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:55:24,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:55:24,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:55:24,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-27 23:55:24,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:55:24,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:55:24,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-27 23:55:24,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:55:24,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:24,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-27 23:55:24,677 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-27 23:55:24,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-27 23:55:24,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-12-27 23:55:24,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-12-27 23:55:24,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,797 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-27 23:55:24,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2021-12-27 23:55:24,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:55:24,811 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-27 23:55:24,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2021-12-27 23:55:24,818 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:55:24,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:55:24,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-27 23:55:24,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-27 23:55:24,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-27 23:55:24,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2021-12-27 23:55:24,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2021-12-27 23:55:25,053 INFO L353 Elim1Store]: treesize reduction 44, result has 55.6 percent of original size [2021-12-27 23:55:25,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 75 [2021-12-27 23:55:25,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-27 23:55:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:55:25,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:55:26,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 82 [2021-12-27 23:55:26,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2021-12-27 23:55:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 23:55:28,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982489987] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:55:28,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:55:28,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 25 [2021-12-27 23:55:28,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910113222] [2021-12-27 23:55:28,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:55:28,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-27 23:55:28,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:55:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-27 23:55:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2021-12-27 23:55:28,144 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 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) [2021-12-27 23:55:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:55:29,562 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-27 23:55:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-27 23:55:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-27 23:55:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:55:29,563 INFO L225 Difference]: With dead ends: 47 [2021-12-27 23:55:29,563 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 23:55:29,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=510, Invalid=1842, Unknown=0, NotChecked=0, Total=2352 [2021-12-27 23:55:29,564 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:55:29,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 40 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 135 Invalid, 0 Unknown, 23 Unchecked, 0.2s Time] [2021-12-27 23:55:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 23:55:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 23:55:29,565 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) [2021-12-27 23:55:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 23:55:29,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-12-27 23:55:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:55:29,566 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 23:55:29,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 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) [2021-12-27 23:55:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 23:55:29,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 23:55:29,567 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 23:55:29,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-27 23:55:29,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:55:29,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 602) no Hoare annotation was computed. [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point L601(line 601) no Hoare annotation was computed. [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point L595-1(lines 595 599) no Hoare annotation was computed. [2021-12-27 23:55:29,951 INFO L854 garLoopResultBuilder]: At program point L595-3(lines 595 599) the Hoare annotation is: (and (= |ULTIMATE.start_main_~m~0#1.offset| 0) (<= (div (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (- 2)) 50)) [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point L595-4(lines 595 599) no Hoare annotation was computed. [2021-12-27 23:55:29,951 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 601) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 601) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 597) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point L596-2(lines 596 597) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2021-12-27 23:55:29,952 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 584 593) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~m~0#1.base|) 1) (= |ULTIMATE.start_main_~m~0#1.offset| (select .cse0 (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~m~0#1.base| .cse1)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 1) (= |ULTIMATE.start_main_~m~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= (select (select |#memory_int| .cse1) (select .cse0 .cse2)) 9) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~m~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))))) [2021-12-27 23:55:29,952 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 593) no Hoare annotation was computed. [2021-12-27 23:55:29,953 INFO L858 garLoopResultBuilder]: For program point L584-3(lines 584 593) no Hoare annotation was computed. [2021-12-27 23:55:29,955 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2021-12-27 23:55:29,955 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:55:29,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:29,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:29,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:29,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:29,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:29,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:55:29 BoogieIcfgContainer [2021-12-27 23:55:29,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:55:29,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:55:29,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:55:29,969 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:55:29,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:55:17" (3/4) ... [2021-12-27 23:55:29,972 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-27 23:55:29,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-27 23:55:29,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-27 23:55:29,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-27 23:55:29,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-27 23:55:29,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 23:55:30,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:55:30,000 INFO L158 Benchmark]: Toolchain (without parser) took 13669.67ms. Allocated memory was 56.6MB in the beginning and 142.6MB in the end (delta: 86.0MB). Free memory was 33.2MB in the beginning and 45.5MB in the end (delta: -12.3MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,000 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:55:30,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.39ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 33.1MB in the beginning and 57.2MB in the end (delta: -24.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.59ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 55.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,001 INFO L158 Benchmark]: Boogie Preprocessor took 19.58ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 53.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,001 INFO L158 Benchmark]: RCFGBuilder took 353.95ms. Allocated memory is still 79.7MB. Free memory was 53.7MB in the beginning and 58.7MB in the end (delta: -5.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,001 INFO L158 Benchmark]: TraceAbstraction took 12881.70ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 58.3MB in the beginning and 48.6MB in the end (delta: 9.7MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,002 INFO L158 Benchmark]: Witness Printer took 30.62ms. Allocated memory is still 142.6MB. Free memory was 48.6MB in the beginning and 45.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-27 23:55:30,003 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.39ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 33.1MB in the beginning and 57.2MB in the end (delta: -24.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.59ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 55.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.58ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 53.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.95ms. Allocated memory is still 79.7MB. Free memory was 53.7MB in the beginning and 58.7MB in the end (delta: -5.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12881.70ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 58.3MB in the beginning and 48.6MB in the end (delta: 9.7MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 30.62ms. Allocated memory is still 142.6MB. Free memory was 48.6MB in the beginning and 45.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 601]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 503 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 136 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 84 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 117 SyntacticMatches, 12 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 74, 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, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 99 HoareAnnotationTreeSize, 2 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 2201 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 250 ConstructedInterpolants, 17 QuantifiedInterpolants, 5666 SizeOfPredicates, 58 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 14/78 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: 595]: Loop Invariant Derived loop invariant: m == 0 && -1 * unknown-#memory_int-unknown[m][m] / -2 <= 50 - InvariantResult [Line: 584]: Loop Invariant [2021-12-27 23:55:30,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:30,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:30,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:30,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:30,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:30,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:30,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:30,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-27 23:55:30,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-27 23:55:30,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((unknown-#memory_int-unknown[m][m] == 0 && \valid[m] == 1) && m == #memory_$Pointer$[head][head + 4]) && !(m == #memory_$Pointer$[head][head + 8])) && head == 0) && unknown-#memory_int-unknown[list][list] == 1) && m == 0) && list == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 8]][#memory_$Pointer$[head][head + 8]] <= 9) && \valid[head] == 1) && list == head) && m == #memory_$Pointer$[list][list + 4] RESULT: Ultimate proved your program to be correct! [2021-12-27 23:55:30,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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