./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6441f2629f7ca5357ff69069fc5c217332d52665 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:23:30,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:23:30,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:23:30,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:23:30,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:23:30,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:23:30,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:23:30,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:23:30,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:23:30,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:23:30,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:23:30,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:23:30,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:23:30,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:23:30,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:23:30,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:23:30,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:23:30,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:23:30,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:23:30,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:23:30,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:23:30,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:23:30,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:23:30,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:23:30,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:23:30,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:23:30,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:23:30,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:23:30,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:23:30,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:23:30,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:23:30,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:23:30,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:23:30,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:23:30,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:23:30,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:23:30,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:23:30,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:23:30,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:23:30,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:23:30,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:23:30,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:23:30,776 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:23:30,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:23:30,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:23:30,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:23:30,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:23:30,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:23:30,778 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:23:30,778 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:23:30,778 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:23:30,778 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:23:30,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:23:30,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:23:30,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:23:30,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:23:30,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:23:30,788 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:23:30,788 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:23:30,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:23:30,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:23:30,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:23:30,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:23:30,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:23:30,790 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:23:30,792 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:23:30,792 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6441f2629f7ca5357ff69069fc5c217332d52665 [2021-08-27 14:23:31,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:23:31,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:23:31,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:23:31,057 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:23:31,058 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:23:31,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-08-27 14:23:31,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914d4e488/cf57233c7c974579aedc1abe7524ce31/FLAGeae1f477a [2021-08-27 14:23:31,473 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:23:31,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-08-27 14:23:31,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914d4e488/cf57233c7c974579aedc1abe7524ce31/FLAGeae1f477a [2021-08-27 14:23:31,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914d4e488/cf57233c7c974579aedc1abe7524ce31 [2021-08-27 14:23:31,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:23:31,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:23:31,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:23:31,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:23:31,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:23:31,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:23:31" (1/1) ... [2021-08-27 14:23:31,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cada28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:31, skipping insertion in model container [2021-08-27 14:23:31,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:23:31" (1/1) ... [2021-08-27 14:23:31,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:23:31,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:23:32,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:23:32,045 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:23:32,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:23:32,105 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:23:32,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32 WrapperNode [2021-08-27 14:23:32,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:23:32,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:23:32,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:23:32,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:23:32,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:23:32,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:23:32,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:23:32,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:23:32,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:23:32,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:23:32,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:23:32,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:23:32,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (1/1) ... [2021-08-27 14:23:32,170 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:32,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:32,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:23:32,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:23:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:23:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:23:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:23:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:23:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:23:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:23:32,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:23:32,482 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 14:23:32,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:23:32 BoogieIcfgContainer [2021-08-27 14:23:32,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:23:32,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:23:32,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:23:32,486 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:23:32,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:32,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:23:31" (1/3) ... [2021-08-27 14:23:32,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@da900dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:23:32, skipping insertion in model container [2021-08-27 14:23:32,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:32,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:32" (2/3) ... [2021-08-27 14:23:32,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@da900dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:23:32, skipping insertion in model container [2021-08-27 14:23:32,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:32,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:23:32" (3/3) ... [2021-08-27 14:23:32,489 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2021-08-27 14:23:32,518 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:23:32,518 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:23:32,518 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:23:32,518 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:23:32,518 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:23:32,518 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:23:32,519 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:23:32,519 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:23:32,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08-27 14:23:32,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:23:32,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:32,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:32,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:32,543 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:32,544 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:23:32,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08-27 14:23:32,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:23:32,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:32,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:32,546 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:32,546 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:32,551 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 6#L552-4true [2021-08-27 14:23:32,552 INFO L793 eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 13#L552-1true assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 12#L553-4true assume !true; 5#L552-3true call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 6#L552-4true [2021-08-27 14:23:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:23:32,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:32,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834803382] [2021-08-27 14:23:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:32,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:32,658 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:32,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2021-08-27 14:23:32,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:32,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592211687] [2021-08-27 14:23:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:32,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:32,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:32,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592211687] [2021-08-27 14:23:32,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592211687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:23:32,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:23:32,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:23:32,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308336755] [2021-08-27 14:23:32,786 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:32,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 14:23:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 14:23:32,804 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-08-27 14:23:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:32,808 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-08-27 14:23:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 14:23:32,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-08-27 14:23:32,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:23:32,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2021-08-27 14:23:32,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-08-27 14:23:32,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-08-27 14:23:32,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2021-08-27 14:23:32,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:32,814 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-27 14:23:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2021-08-27 14:23:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-27 14:23:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-08-27 14:23:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-08-27 14:23:32,831 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-27 14:23:32,831 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-27 14:23:32,832 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:23:32,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-08-27 14:23:32,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:23:32,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:32,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:32,833 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:32,833 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:23:32,833 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 33#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 35#L552-4 [2021-08-27 14:23:32,834 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 36#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 38#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 39#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 34#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 35#L552-4 [2021-08-27 14:23:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:23:32,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:32,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809134658] [2021-08-27 14:23:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:32,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:32,860 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:32,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2021-08-27 14:23:32,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:32,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146837246] [2021-08-27 14:23:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:32,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:32,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:32,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146837246] [2021-08-27 14:23:32,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146837246] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:23:32,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:23:32,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:23:32,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165379641] [2021-08-27 14:23:32,951 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:32,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:23:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:23:32,952 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08-27 14:23:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:32,994 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-08-27 14:23:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:23:32,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-08-27 14:23:32,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-08-27 14:23:32,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 14:23:32,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 14:23:32,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 14:23:32,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-08-27 14:23:32,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:32,997 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-08-27 14:23:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-08-27 14:23:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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-08-27 14:23:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 14:23:32,998 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:32,998 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:32,998 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:23:32,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-08-27 14:23:32,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-08-27 14:23:32,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:32,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:32,999 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:32,999 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-27 14:23:32,999 INFO L791 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 60#L552-4 [2021-08-27 14:23:33,000 INFO L793 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 63#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 67#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 66#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 64#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 65#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 68#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 59#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 60#L552-4 [2021-08-27 14:23:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:23:33,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:33,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473789858] [2021-08-27 14:23:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:33,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:33,008 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:33,015 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2021-08-27 14:23:33,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:33,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757446277] [2021-08-27 14:23:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:33,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:33,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:33,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757446277] [2021-08-27 14:23:33,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757446277] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:33,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024782996] [2021-08-27 14:23:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:33,134 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:33,135 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-08-27 14:23:33,136 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-08-27 14:23:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:33,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:23:33,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:33,280 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:33,388 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:33,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:33,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:33,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:33,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:33,624 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:33,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 22 [2021-08-27 14:23:33,652 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:33,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 22 [2021-08-27 14:23:33,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 33 treesize of output 17 [2021-08-27 14:23:33,715 INFO L388 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 23 treesize of output 11 [2021-08-27 14:23:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:33,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024782996] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:33,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:33,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-08-27 14:23:33,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155806117] [2021-08-27 14:23:33,738 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:33,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:23:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:23:33,739 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-08-27 14:23:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:33,839 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2021-08-27 14:23:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:23:33,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2021-08-27 14:23:33,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-08-27 14:23:33,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 14:23:33,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 14:23:33,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 14:23:33,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2021-08-27 14:23:33,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:33,841 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:23:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2021-08-27 14:23:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-27 14:23:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 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-08-27 14:23:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-08-27 14:23:33,843 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-27 14:23:33,843 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-27 14:23:33,843 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:23:33,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2021-08-27 14:23:33,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-08-27 14:23:33,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:33,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:33,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:33,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 1, 1, 1, 1] [2021-08-27 14:23:33,844 INFO L791 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 127#L552-4 [2021-08-27 14:23:33,844 INFO L793 eck$LassoCheckResult]: Loop: 127#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 128#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 133#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 139#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 129#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 130#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 131#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 132#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 138#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 137#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 135#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 136#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 134#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 126#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 127#L552-4 [2021-08-27 14:23:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:23:33,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:33,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134921119] [2021-08-27 14:23:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:33,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:33,852 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:33,862 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1818601484, now seen corresponding path program 2 times [2021-08-27 14:23:33,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:33,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960648709] [2021-08-27 14:23:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:33,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:34,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:34,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960648709] [2021-08-27 14:23:34,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960648709] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:34,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75880442] [2021-08-27 14:23:34,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:23:34,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:34,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:34,205 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-08-27 14:23:34,206 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-08-27 14:23:34,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:23:34,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:34,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:23:34,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:34,275 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:34,359 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:34,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:34,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:34,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:34,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:34,435 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:34,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 18 [2021-08-27 14:23:34,526 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:34,526 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:34,658 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:34,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:34,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:34,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 14:23:34,741 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:34,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 26 [2021-08-27 14:23:34,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:34,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2021-08-27 14:23:34,917 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:34,918 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:35,041 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:35,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:35,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:35,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:35,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:35,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:35,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 14:23:35,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 33 treesize of output 17 [2021-08-27 14:23:35,228 INFO L388 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 23 treesize of output 11 [2021-08-27 14:23:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:35,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75880442] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:35,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:35,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2021-08-27 14:23:35,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549769046] [2021-08-27 14:23:35,237 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:35,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 14:23:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-08-27 14:23:35,240 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 2 Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-08-27 14:23:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:35,435 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-08-27 14:23:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:23:35,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-08-27 14:23:35,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-08-27 14:23:35,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-08-27 14:23:35,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 14:23:35,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 14:23:35,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-08-27 14:23:35,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:35,438 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-08-27 14:23:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-08-27 14:23:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 14:23:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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-08-27 14:23:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 14:23:35,442 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:23:35,442 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:23:35,442 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:23:35,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-08-27 14:23:35,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-08-27 14:23:35,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:35,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:35,444 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:35,444 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2021-08-27 14:23:35,444 INFO L791 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 231#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 229#L552-4 [2021-08-27 14:23:35,444 INFO L793 eck$LassoCheckResult]: Loop: 229#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 237#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 246#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 233#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 234#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 235#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 236#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 245#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 244#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 243#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 242#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 241#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 239#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 240#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 238#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 228#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 229#L552-4 [2021-08-27 14:23:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:23:35,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:35,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317116059] [2021-08-27 14:23:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:35,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:35,462 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:35,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 3 times [2021-08-27 14:23:35,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:35,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806856343] [2021-08-27 14:23:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:35,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:35,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:35,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806856343] [2021-08-27 14:23:35,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806856343] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:35,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743974900] [2021-08-27 14:23:35,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:23:35,788 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:35,793 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-08-27 14:23:35,840 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-08-27 14:23:35,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 14:23:35,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:35,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 14:23:35,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:35,917 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:35,967 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:35,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:35,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:35,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:36,029 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:36,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 26 [2021-08-27 14:23:36,097 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:36,098 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:36,205 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:36,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:36,232 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:36,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:36,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:36,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 14:23:36,431 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:36,431 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:36,542 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:36,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:36,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:36,604 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:36,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 47 [2021-08-27 14:23:36,688 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:36,688 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:36,800 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:36,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:36,818 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:36,924 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:36,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 14:23:36,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:36,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 33 treesize of output 17 [2021-08-27 14:23:36,994 INFO L388 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 23 treesize of output 11 [2021-08-27 14:23:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:37,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743974900] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:37,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:37,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2021-08-27 14:23:37,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890766690] [2021-08-27 14:23:37,002 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:37,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 14:23:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2021-08-27 14:23:37,003 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-08-27 14:23:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:37,265 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-08-27 14:23:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 14:23:37,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-08-27 14:23:37,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-08-27 14:23:37,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 14:23:37,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 14:23:37,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-27 14:23:37,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-08-27 14:23:37,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:37,266 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:23:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-08-27 14:23:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 14:23:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 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-08-27 14:23:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-08-27 14:23:37,268 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 14:23:37,268 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-27 14:23:37,268 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:23:37,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-08-27 14:23:37,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-08-27 14:23:37,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:37,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:37,269 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:37,269 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-08-27 14:23:37,269 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 357#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 355#L552-4 [2021-08-27 14:23:37,269 INFO L793 eck$LassoCheckResult]: Loop: 355#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 363#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 375#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 359#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 360#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 361#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 362#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 374#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 373#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 372#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 371#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 370#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 369#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 368#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 367#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 365#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 366#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 364#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 354#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 355#L552-4 [2021-08-27 14:23:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:23:37,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:37,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739233070] [2021-08-27 14:23:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:37,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:37,274 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:37,283 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 4 times [2021-08-27 14:23:37,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:37,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483165882] [2021-08-27 14:23:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:37,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:37,306 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:37,335 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2021-08-27 14:23:37,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:37,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534771135] [2021-08-27 14:23:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:37,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:37,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:37,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534771135] [2021-08-27 14:23:37,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534771135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:37,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739726834] [2021-08-27 14:23:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:37,547 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:37,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:37,556 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-08-27 14:23:37,572 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-08-27 14:23:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:37,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 14:23:37,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:37,675 INFO L388 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 14 treesize of output 12 [2021-08-27 14:23:37,686 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:37,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 14:23:37,701 INFO L388 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 53 treesize of output 22 [2021-08-27 14:23:37,722 INFO L388 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 25 treesize of output 13 [2021-08-27 14:23:37,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 14:23:37,748 INFO L388 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 53 treesize of output 22 [2021-08-27 14:23:37,759 INFO L388 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 25 treesize of output 13 [2021-08-27 14:23:37,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 14:23:37,787 INFO L388 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 53 treesize of output 22 [2021-08-27 14:23:37,800 INFO L388 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 25 treesize of output 13 [2021-08-27 14:23:37,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 14:23:37,828 INFO L388 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 53 treesize of output 22 [2021-08-27 14:23:37,838 INFO L388 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 25 treesize of output 13 [2021-08-27 14:23:37,882 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:37,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 66 [2021-08-27 14:23:37,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:37,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:37,927 INFO L388 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 15 treesize of output 7 [2021-08-27 14:23:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:37,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739726834] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:37,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:37,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2021-08-27 14:23:37,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933058635] [2021-08-27 14:23:45,141 WARN L207 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 169 DAG size of output: 158 [2021-08-27 14:23:46,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 14:23:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-08-27 14:23:46,254 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-08-27 14:23:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:46,425 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-08-27 14:23:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 14:23:46,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2021-08-27 14:23:46,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2021-08-27 14:23:46,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2021-08-27 14:23:46,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-27 14:23:46,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-27 14:23:46,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2021-08-27 14:23:46,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:46,427 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-08-27 14:23:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2021-08-27 14:23:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 14:23:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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-08-27 14:23:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 14:23:46,429 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:23:46,429 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:23:46,429 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:23:46,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-27 14:23:46,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-27 14:23:46,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:46,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:46,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:46,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 1, 1, 1, 1] [2021-08-27 14:23:46,430 INFO L791 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 507#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 509#L552-4 [2021-08-27 14:23:46,430 INFO L793 eck$LassoCheckResult]: Loop: 509#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 510#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 515#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 530#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 511#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 512#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 513#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 514#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 529#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 528#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 527#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 526#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 525#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 524#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 523#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 522#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 521#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 520#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 519#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 517#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 518#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 516#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 508#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 509#L552-4 [2021-08-27 14:23:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:23:46,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:46,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550041576] [2021-08-27 14:23:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:46,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:46,435 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:46,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash 665592497, now seen corresponding path program 5 times [2021-08-27 14:23:46,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:46,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947072504] [2021-08-27 14:23:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:46,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:47,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:47,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947072504] [2021-08-27 14:23:47,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947072504] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:47,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173104818] [2021-08-27 14:23:47,109 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:23:47,109 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:47,120 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-08-27 14:23:47,144 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-08-27 14:23:47,309 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-08-27 14:23:47,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:47,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 14:23:47,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:47,320 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:47,388 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:47,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:47,428 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:47,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 17 [2021-08-27 14:23:47,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-08-27 14:23:47,522 INFO L388 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-08-27 14:23:47,611 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:47,611 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:47,743 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:47,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:47,765 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:47,817 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:47,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 47 [2021-08-27 14:23:47,923 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:47,923 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:48,050 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:48,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:48,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:48,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 67 treesize of output 47 [2021-08-27 14:23:48,168 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:48,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-08-27 14:23:48,273 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:48,274 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:48,390 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:48,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:48,403 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:48,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 67 treesize of output 47 [2021-08-27 14:23:48,505 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:48,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-08-27 14:23:48,595 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:48,595 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:48,713 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:48,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:48,728 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:48,819 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:48,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 39 [2021-08-27 14:23:48,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 59 treesize of output 39 [2021-08-27 14:23:48,939 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:48,939 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:49,090 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:49,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 71 [2021-08-27 14:23:49,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:49,114 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:49,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 18 [2021-08-27 14:23:49,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:49,185 INFO L388 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 15 treesize of output 7 [2021-08-27 14:23:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:49,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173104818] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:49,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:49,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2021-08-27 14:23:49,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880603863] [2021-08-27 14:23:49,191 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:49,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 14:23:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 14:23:49,192 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-08-27 14:23:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:49,709 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-08-27 14:23:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 14:23:49,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-08-27 14:23:49,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-08-27 14:23:49,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-08-27 14:23:49,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 14:23:49,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 14:23:49,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-08-27 14:23:49,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:49,711 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-08-27 14:23:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-08-27 14:23:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 14:23:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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-08-27 14:23:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-08-27 14:23:49,712 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-08-27 14:23:49,712 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-08-27 14:23:49,712 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:23:49,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2021-08-27 14:23:49,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-08-27 14:23:49,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:49,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:49,713 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:49,713 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 1, 1, 1, 1] [2021-08-27 14:23:49,713 INFO L791 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 680#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 678#L552-4 [2021-08-27 14:23:49,713 INFO L793 eck$LassoCheckResult]: Loop: 678#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 681#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 686#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 704#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 682#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 683#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 684#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 685#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 703#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 702#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 701#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 700#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 699#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 698#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 697#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 696#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 695#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 694#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 693#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 692#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 691#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 690#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 688#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 689#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 687#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 677#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 678#L552-4 [2021-08-27 14:23:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:23:49,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:49,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905042125] [2021-08-27 14:23:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:49,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:49,718 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:49,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1196184628, now seen corresponding path program 6 times [2021-08-27 14:23:49,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:49,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693443350] [2021-08-27 14:23:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:49,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:50,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:50,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693443350] [2021-08-27 14:23:50,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693443350] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:50,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770457300] [2021-08-27 14:23:50,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:23:50,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:50,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:50,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 14:23:50,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-08-27 14:23:50,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:50,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 14:23:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:50,796 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:50,843 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:50,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:50,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:50,889 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:50,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 18 [2021-08-27 14:23:50,906 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:50,993 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:50,994 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:51,111 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:51,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:51,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:51,188 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:51,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 18 [2021-08-27 14:23:51,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:51,286 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:51,287 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:51,395 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:51,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:51,410 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:51,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:51,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2021-08-27 14:23:51,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 26 [2021-08-27 14:23:51,611 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:51,611 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:51,726 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:51,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:51,747 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:51,778 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:51,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 67 treesize of output 47 [2021-08-27 14:23:51,832 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:51,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-08-27 14:23:51,933 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:51,933 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:52,046 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:52,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:52,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:52,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:52,175 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:52,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 14:23:52,271 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:52,271 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:52,386 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:52,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:52,406 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:52,509 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:52,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-08-27 14:23:52,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 67 treesize of output 47 [2021-08-27 14:23:52,622 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:52,622 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:52,773 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:52,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 71 [2021-08-27 14:23:52,815 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-08-27 14:23:52,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 31 [2021-08-27 14:23:52,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:52,873 INFO L388 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 15 treesize of output 7 [2021-08-27 14:23:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:52,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770457300] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:52,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:52,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 39 [2021-08-27 14:23:52,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414102103] [2021-08-27 14:23:52,878 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:52,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:52,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-27 14:23:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2021-08-27 14:23:52,879 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 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-08-27 14:23:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:53,478 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-08-27 14:23:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 14:23:53,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 33 transitions. [2021-08-27 14:23:53,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2021-08-27 14:23:53,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 33 transitions. [2021-08-27 14:23:53,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-08-27 14:23:53,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-27 14:23:53,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 33 transitions. [2021-08-27 14:23:53,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:53,479 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-08-27 14:23:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 33 transitions. [2021-08-27 14:23:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-08-27 14:23:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 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-08-27 14:23:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-08-27 14:23:53,481 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-08-27 14:23:53,481 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-08-27 14:23:53,481 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:23:53,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2021-08-27 14:23:53,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-27 14:23:53,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:53,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:53,482 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:53,482 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 1, 1, 1, 1] [2021-08-27 14:23:53,482 INFO L791 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 877#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 875#L552-4 [2021-08-27 14:23:53,482 INFO L793 eck$LassoCheckResult]: Loop: 875#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 878#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 883#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 904#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 879#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 880#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 881#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 882#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 903#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 902#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 901#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 900#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 899#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 898#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 897#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 896#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 895#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 894#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 893#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 892#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 891#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 890#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 889#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 888#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 887#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 885#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 886#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 884#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 874#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 875#L552-4 [2021-08-27 14:23:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:23:53,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:53,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719885799] [2021-08-27 14:23:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:53,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:53,489 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:53,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash -190854959, now seen corresponding path program 7 times [2021-08-27 14:23:53,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:53,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217143785] [2021-08-27 14:23:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:53,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:54,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:54,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217143785] [2021-08-27 14:23:54,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217143785] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:54,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192388782] [2021-08-27 14:23:54,430 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:23:54,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:54,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:54,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:54,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 14:23:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:54,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 14:23:54,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:54,688 INFO L388 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 11 treesize of output 7 [2021-08-27 14:23:54,729 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:54,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 90 [2021-08-27 14:23:54,742 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:54,759 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:54,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2021-08-27 14:23:54,796 INFO L388 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-08-27 14:23:54,925 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:54,925 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:55,047 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:55,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:55,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:55,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:55,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 14:23:55,090 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:55,111 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:55,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 47 [2021-08-27 14:23:55,209 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:55,210 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:55,333 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:55,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:55,389 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:55,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 59 treesize of output 39 [2021-08-27 14:23:55,464 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:55,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 39 [2021-08-27 14:23:55,557 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:55,557 INFO L388 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 57 treesize of output 64 [2021-08-27 14:23:55,704 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:55,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:55,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 14:23:55,801 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:55,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 14:23:55,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 18 [2021-08-27 14:23:55,923 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:55,923 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:56,035 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-08-27 14:23:56,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 111 [2021-08-27 14:23:56,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 14:23:56,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 14:23:56,112 INFO L388 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 13 treesize of output 9 [2021-08-27 14:23:56,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 14:23:56,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2021-08-27 14:23:56,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 26 [2021-08-27 14:23:56,251 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:56,251 INFO L388 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 50 treesize of output 61 [2021-08-27 14:23:56,395 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:56,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 62 [2021-08-27 14:23:56,406 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:56,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-08-27 14:23:56,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:56,522 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:56,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 62 [2021-08-27 14:23:56,541 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 14:23:56,559 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:56,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 18 [2021-08-27 14:23:56,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:56,664 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-08-27 14:23:56,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 71 [2021-08-27 14:23:56,707 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-08-27 14:23:56,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 31 [2021-08-27 14:23:56,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:56,769 INFO L388 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 15 treesize of output 7 [2021-08-27 14:23:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:56,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192388782] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:56,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:56,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 44 [2021-08-27 14:23:56,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261520670] [2021-08-27 14:23:56,774 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:23:56,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-27 14:23:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 14:23:56,776 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 44 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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-08-27 14:23:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:57,375 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2021-08-27 14:23:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 14:23:57,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2021-08-27 14:23:57,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-08-27 14:23:57,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2021-08-27 14:23:57,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-08-27 14:23:57,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-08-27 14:23:57,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2021-08-27 14:23:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:57,377 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-08-27 14:23:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2021-08-27 14:23:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-08-27 14:23:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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-08-27 14:23:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-08-27 14:23:57,379 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-08-27 14:23:57,379 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-08-27 14:23:57,379 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:23:57,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2021-08-27 14:23:57,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-08-27 14:23:57,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:57,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:57,380 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:57,380 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2021-08-27 14:23:57,380 INFO L791 eck$LassoCheckResult]: Stem: 1087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1088#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 1090#L552-4 [2021-08-27 14:23:57,380 INFO L793 eck$LassoCheckResult]: Loop: 1090#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1091#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 1096#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1120#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1092#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1093#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1094#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1095#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1119#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1118#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1117#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1116#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1115#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1114#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1113#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1112#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1111#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1110#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1109#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1108#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1107#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1106#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1105#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1104#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1103#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1102#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1101#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1100#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1098#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1099#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1097#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 1089#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 1090#L552-4 [2021-08-27 14:23:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-27 14:23:57,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:57,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20588011] [2021-08-27 14:23:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:57,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,387 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 8 times [2021-08-27 14:23:57,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:57,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519789811] [2021-08-27 14:23:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:57,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,408 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,426 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 2 times [2021-08-27 14:23:57,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:57,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243271881] [2021-08-27 14:23:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:57,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,446 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:57,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:24:36,610 WARN L207 SmtUtils]: Spent 39.14 s on a formula simplification. DAG size of input: 257 DAG size of output: 247 [2021-08-27 14:24:41,575 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:24:41,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:24:41,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:24:41,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:24:41,576 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:24:41,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:24:41,576 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:24:41,576 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:24:41,576 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration10_Lasso [2021-08-27 14:24:41,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:24:41,576 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:24:41,582 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.base/java.lang.Math.toIntExact(Math.java:1074) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:551) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 14:24:41,585 INFO L168 Benchmark]: Toolchain (without parser) took 69718.12 ms. Allocated memory was 56.6 MB in the beginning and 239.1 MB in the end (delta: 182.5 MB). Free memory was 34.8 MB in the beginning and 176.8 MB in the end (delta: -142.0 MB). Peak memory consumption was 181.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:24:41,585 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.7 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:24:41,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.67 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 34.6 MB in the beginning and 52.7 MB in the end (delta: -18.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:24:41,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.85 ms. Allocated memory is still 73.4 MB. Free memory was 52.7 MB in the beginning and 51.0 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:24:41,586 INFO L168 Benchmark]: Boogie Preprocessor took 13.89 ms. Allocated memory is still 73.4 MB. Free memory was 51.0 MB in the beginning and 49.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:24:41,586 INFO L168 Benchmark]: RCFGBuilder took 318.75 ms. Allocated memory is still 73.4 MB. Free memory was 49.7 MB in the beginning and 52.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. [2021-08-27 14:24:41,587 INFO L168 Benchmark]: BuchiAutomizer took 69100.54 ms. Allocated memory was 73.4 MB in the beginning and 239.1 MB in the end (delta: 165.7 MB). Free memory was 52.5 MB in the beginning and 176.8 MB in the end (delta: -124.3 MB). Peak memory consumption was 182.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:24:41,588 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.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.7 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 240.67 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 34.6 MB in the beginning and 52.7 MB in the end (delta: -18.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.85 ms. Allocated memory is still 73.4 MB. Free memory was 52.7 MB in the beginning and 51.0 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 13.89 ms. Allocated memory is still 73.4 MB. Free memory was 51.0 MB in the beginning and 49.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 318.75 ms. Allocated memory is still 73.4 MB. Free memory was 49.7 MB in the beginning and 52.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 69100.54 ms. Allocated memory was 73.4 MB in the beginning and 239.1 MB in the end (delta: 165.7 MB). Free memory was 52.5 MB in the beginning and 176.8 MB in the end (delta: -124.3 MB). Peak memory consumption was 182.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.base/java.lang.Math.toIntExact(Math.java:1074) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 14:24:41,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:24:41,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:24:42,045 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-08-27 14:24:42,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:24:42,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-27 14:24:42,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-27 14:24:42,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-27 14:24:43,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...