./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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-15/array13_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 bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:04:33,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:04:33,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:04:33,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:04:33,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:04:33,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:04:33,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:04:33,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:04:33,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:04:33,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:04:33,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:04:33,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:04:33,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:04:33,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:04:33,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:04:33,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:04:33,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:04:33,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:04:33,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:04:33,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:04:33,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:04:33,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:04:33,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:04:33,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:04:33,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:04:33,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:04:33,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:04:33,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:04:33,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:04:33,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:04:33,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:04:33,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:04:33,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:04:33,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:04:33,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:04:33,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:04:33,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:04:33,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:04:33,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:04:33,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:04:33,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:04:33,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-21 22:04:33,918 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:04:33,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:04:33,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:04:33,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:04:33,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:04:33,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:04:33,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:04:33,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:04:33,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:04:33,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:04:33,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:04:33,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:04:33,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:04:33,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:04:33,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:04:33,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:04:33,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:04:33,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:04:33,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:04:33,924 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 -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2021-12-21 22:04:34,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:04:34,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:04:34,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:04:34,165 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:04:34,165 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:04:34,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array13_alloca.i [2021-12-21 22:04:34,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6717976bf/0a16f680cd134d54822d35cea2bc95e6/FLAGddd481ad9 [2021-12-21 22:04:34,627 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:04:34,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i [2021-12-21 22:04:34,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6717976bf/0a16f680cd134d54822d35cea2bc95e6/FLAGddd481ad9 [2021-12-21 22:04:34,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6717976bf/0a16f680cd134d54822d35cea2bc95e6 [2021-12-21 22:04:34,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:04:34,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:04:34,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:04:34,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:04:34,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:04:34,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:04:34" (1/1) ... [2021-12-21 22:04:34,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef46d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:34, skipping insertion in model container [2021-12-21 22:04:34,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:04:34" (1/1) ... [2021-12-21 22:04:34,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:04:34,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:04:34,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:04:34,936 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:04:34,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:04:35,008 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:04:35,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35 WrapperNode [2021-12-21 22:04:35,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:04:35,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:04:35,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:04:35,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:04:35,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,035 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-21 22:04:35,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:04:35,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:04:35,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:04:35,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:04:35,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:04:35,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:04:35,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:04:35,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:04:35,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (1/1) ... [2021-12-21 22:04:35,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:35,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:35,097 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-12-21 22:04:35,101 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-12-21 22:04:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:04:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:04:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:04:35,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:04:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:04:35,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:04:35,198 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:04:35,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:04:35,316 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:04:35,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:04:35,320 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 22:04:35,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:04:35 BoogieIcfgContainer [2021-12-21 22:04:35,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:04:35,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:04:35,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:04:35,325 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:04:35,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:04:35,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:04:34" (1/3) ... [2021-12-21 22:04:35,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a51919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:04:35, skipping insertion in model container [2021-12-21 22:04:35,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:04:35,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:04:35" (2/3) ... [2021-12-21 22:04:35,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a51919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:04:35, skipping insertion in model container [2021-12-21 22:04:35,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:04:35,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:04:35" (3/3) ... [2021-12-21 22:04:35,343 INFO L388 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2021-12-21 22:04:35,371 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:04:35,372 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:04:35,372 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:04:35,372 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:04:35,372 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:04:35,372 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:04:35,372 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:04:35,372 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:04:35,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:35,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:04:35,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:35,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:35,411 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:04:35,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:04:35,411 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:04:35,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:35,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:04:35,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:35,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:35,414 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:04:35,414 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:04:35,419 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2021-12-21 22:04:35,420 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2021-12-21 22:04:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-12-21 22:04:35,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:35,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123686391] [2021-12-21 22:04:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:35,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2021-12-21 22:04:35,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:35,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390558173] [2021-12-21 22:04:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:35,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,603 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2021-12-21 22:04:35,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049747115] [2021-12-21 22:04:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:35,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:35,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:35,868 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:04:35,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:04:35,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:04:35,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:04:35,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:04:35,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:35,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:04:35,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:04:35,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2021-12-21 22:04:35,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:04:35,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:04:35,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:35,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:35,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:35,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:35,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:04:36,197 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:04:36,200 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:04:36,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,208 INFO L229 MonitoredProcess]: Starting monitored process 2 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-12-21 22:04:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:04:36,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:04:36,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:04:36,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:04:36,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-21 22:04:36,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,250 INFO L229 MonitoredProcess]: Starting monitored process 3 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-12-21 22:04:36,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:04:36,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:04:36,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:04:36,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,302 INFO L229 MonitoredProcess]: Starting monitored process 4 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-12-21 22:04:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:04:36,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:04:36,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:04:36,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:04:36,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,350 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12-21 22:04:36,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:04:36,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:04:36,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:04:36,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:04:36,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,403 INFO L229 MonitoredProcess]: Starting monitored process 6 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-12-21 22:04:36,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 22:04:36,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:04:36,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:04:36,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:04:36,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,443 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12-21 22:04:36,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 22:04:36,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:04:36,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:04:36,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,488 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12-21 22:04:36,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 22:04:36,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:04:36,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:04:36,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:04:36,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,538 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12-21 22:04:36,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 22:04:36,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:04:36,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:04:36,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:04:36,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:04:36,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:04:36,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:04:36,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:04:36,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:04:36,622 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-21 22:04:36,622 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-21 22:04:36,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:04:36,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:36,625 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12-21 22:04:36,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-21 22:04:36,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:04:36,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:04:36,688 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:04:36,688 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2021-12-21 22:04:36,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-21 22:04:36,735 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-21 22:04:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:36,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:04:36,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:36,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:04:36,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:36,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:04:36,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:36,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2021-12-21 22:04:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:04:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-21 22:04:36,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-21 22:04:36,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:04:36,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2021-12-21 22:04:36,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:04:36,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-21 22:04:36,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:04:36,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-12-21 22:04:36,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:36,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2021-12-21 22:04:36,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-21 22:04:36,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-21 22:04:36,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2021-12-21 22:04:36,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:04:36,926 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-21 22:04:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2021-12-21 22:04:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-21 22:04:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-12-21 22:04:36,942 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-21 22:04:36,942 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-21 22:04:36,942 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:04:36,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2021-12-21 22:04:36,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:36,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:36,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:36,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:04:36,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:04:36,943 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 121#L367 assume !(main_~length~0#1 < 1); 115#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 116#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 117#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 118#L370-4 main_~j~0#1 := 0; 119#L378-2 [2021-12-21 22:04:36,943 INFO L793 eck$LassoCheckResult]: Loop: 119#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 120#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 119#L378-2 [2021-12-21 22:04:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2021-12-21 22:04:36,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:36,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743974596] [2021-12-21 22:04:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:36,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:36,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:04:36,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743974596] [2021-12-21 22:04:36,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743974596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:04:36,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:04:36,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:04:36,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785555582] [2021-12-21 22:04:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:04:36,977 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:04:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2021-12-21 22:04:36,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:36,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190773221] [2021-12-21 22:04:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:36,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:36,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:36,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:37,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:04:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:04:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:04:37,033 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:04:37,056 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-12-21 22:04:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:04:37,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-12-21 22:04:37,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:37,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-12-21 22:04:37,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-21 22:04:37,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-21 22:04:37,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-21 22:04:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:04:37,062 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-21 22:04:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-21 22:04:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2021-12-21 22:04:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-21 22:04:37,064 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-21 22:04:37,064 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-21 22:04:37,064 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:04:37,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-21 22:04:37,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:37,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:37,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:37,067 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:04:37,067 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:04:37,067 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 150#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 155#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 157#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 156#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 151#L370-4 main_~j~0#1 := 0; 152#L378-2 [2021-12-21 22:04:37,068 INFO L793 eck$LassoCheckResult]: Loop: 152#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 153#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 152#L378-2 [2021-12-21 22:04:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2021-12-21 22:04:37,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554704449] [2021-12-21 22:04:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2021-12-21 22:04:37,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787406646] [2021-12-21 22:04:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2021-12-21 22:04:37,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564370629] [2021-12-21 22:04:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:04:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564370629] [2021-12-21 22:04:37,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564370629] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:04:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199935490] [2021-12-21 22:04:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:04:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:37,263 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:04:37,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 22:04:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:37,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 22:04:37,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:37,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 22:04:37,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 22:04:37,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-21 22:04:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:04:37,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-21 22:04:37,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-12-21 22:04:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199935490] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:04:37,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:04:37,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2021-12-21 22:04:37,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622780240] [2021-12-21 22:04:37,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:04:37,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:04:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 22:04:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-21 22:04:37,531 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:04:37,609 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-12-21 22:04:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 22:04:37,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-12-21 22:04:37,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:04:37,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-12-21 22:04:37,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:04:37,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:04:37,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-21 22:04:37,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:04:37,619 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-21 22:04:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-21 22:04:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2021-12-21 22:04:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-12-21 22:04:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-12-21 22:04:37,624 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-21 22:04:37,624 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-21 22:04:37,624 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:04:37,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-12-21 22:04:37,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:37,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:37,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:37,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:04:37,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:04:37,628 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 278#L367 assume !(main_~length~0#1 < 1); 272#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 273#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 274#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 279#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 283#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 280#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 281#L370-4 main_~j~0#1 := 0; 287#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 275#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 276#L378-2 [2021-12-21 22:04:37,628 INFO L793 eck$LassoCheckResult]: Loop: 276#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 284#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 276#L378-2 [2021-12-21 22:04:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2021-12-21 22:04:37,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390782644] [2021-12-21 22:04:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2021-12-21 22:04:37,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401386275] [2021-12-21 22:04:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:37,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2021-12-21 22:04:37,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:37,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832955435] [2021-12-21 22:04:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:04:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832955435] [2021-12-21 22:04:37,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832955435] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:04:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723343243] [2021-12-21 22:04:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:37,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:04:37,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:37,766 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:04:37,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 22:04:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:37,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:04:37,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:04:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:37,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723343243] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:04:37,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:04:37,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-12-21 22:04:37,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969533163] [2021-12-21 22:04:37,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:04:37,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:04:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 22:04:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-12-21 22:04:37,939 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:04:38,109 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2021-12-21 22:04:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 22:04:38,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2021-12-21 22:04:38,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:04:38,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2021-12-21 22:04:38,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-21 22:04:38,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-21 22:04:38,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2021-12-21 22:04:38,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:04:38,112 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-12-21 22:04:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2021-12-21 22:04:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2021-12-21 22:04:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-21 22:04:38,116 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-21 22:04:38,116 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-21 22:04:38,116 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:04:38,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2021-12-21 22:04:38,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:04:38,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:38,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:38,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:04:38,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:04:38,117 INFO L791 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 450#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 443#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 444#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 445#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 461#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 462#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 458#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 459#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 446#L370-4 main_~j~0#1 := 0; 447#L378-2 [2021-12-21 22:04:38,118 INFO L793 eck$LassoCheckResult]: Loop: 447#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 457#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 447#L378-2 [2021-12-21 22:04:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2021-12-21 22:04:38,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:38,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810250636] [2021-12-21 22:04:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:38,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:04:38,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810250636] [2021-12-21 22:04:38,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810250636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:04:38,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567630930] [2021-12-21 22:04:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:04:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:38,200 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:04:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 22:04:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:38,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:04:38,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:38,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:04:38,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567630930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:04:38,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:04:38,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-21 22:04:38,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408667457] [2021-12-21 22:04:38,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:04:38,291 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:04:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2021-12-21 22:04:38,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:38,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829751897] [2021-12-21 22:04:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:38,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:04:38,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:04:38,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 22:04:38,340 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-12-21 22:04:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:04:38,353 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2021-12-21 22:04:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:04:38,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2021-12-21 22:04:38,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:38,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2021-12-21 22:04:38,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-21 22:04:38,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-21 22:04:38,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-21 22:04:38,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:04:38,359 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-21 22:04:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-21 22:04:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-21 22:04:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:04:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-21 22:04:38,362 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-21 22:04:38,362 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-21 22:04:38,362 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:04:38,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2021-12-21 22:04:38,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:04:38,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:04:38,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:04:38,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:04:38,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:04:38,364 INFO L791 eck$LassoCheckResult]: Stem: 549#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 557#L367 assume !(main_~length~0#1 < 1); 551#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 552#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 553#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 558#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 565#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 559#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 560#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 563#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 564#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 554#L370-4 main_~j~0#1 := 0; 555#L378-2 [2021-12-21 22:04:38,364 INFO L793 eck$LassoCheckResult]: Loop: 555#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 561#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 555#L378-2 [2021-12-21 22:04:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2021-12-21 22:04:38,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:38,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112637603] [2021-12-21 22:04:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,377 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2021-12-21 22:04:38,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958884060] [2021-12-21 22:04:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:04:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:04:38,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:04:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:04:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2021-12-21 22:04:38,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:04:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876805420] [2021-12-21 22:04:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:04:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:38,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:04:38,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876805420] [2021-12-21 22:04:38,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876805420] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:04:38,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607873561] [2021-12-21 22:04:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:04:38,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:04:38,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:04:38,505 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:04:38,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 22:04:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:04:38,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-21 22:04:38,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:04:38,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 22:04:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:04:38,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:04:38,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:04:38,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:04:38,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 22:04:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:04:38,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:04:50,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) is different from false [2021-12-21 22:05:02,800 WARN L227 SmtUtils]: Spent 12.00s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 22:05:02,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-21 22:05:02,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2021-12-21 22:05:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 22:05:02,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607873561] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:05:02,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:05:02,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2021-12-21 22:05:02,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821867804] [2021-12-21 22:05:02,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:05:02,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:05:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 22:05:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=239, Unknown=1, NotChecked=32, Total=342 [2021-12-21 22:05:02,938 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:05:14,968 WARN L838 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-21 22:05:26,985 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-21 22:05:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:05:27,074 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2021-12-21 22:05:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 22:05:27,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2021-12-21 22:05:27,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-21 22:05:27,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 56 transitions. [2021-12-21 22:05:27,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-21 22:05:27,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-21 22:05:27,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2021-12-21 22:05:27,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:05:27,076 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2021-12-21 22:05:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2021-12-21 22:05:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2021-12-21 22:05:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:05:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2021-12-21 22:05:27,078 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-21 22:05:27,078 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-21 22:05:27,078 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:05:27,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2021-12-21 22:05:27,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:05:27,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:05:27,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:05:27,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:05:27,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:05:27,082 INFO L791 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 733#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 741#L367 assume !(main_~length~0#1 < 1); 734#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 735#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 736#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 742#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 750#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 743#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 744#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 746#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 757#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 739#L370-4 main_~j~0#1 := 0; 740#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 737#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 738#L378-2 [2021-12-21 22:05:27,082 INFO L793 eck$LassoCheckResult]: Loop: 738#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 751#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 738#L378-2 [2021-12-21 22:05:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2021-12-21 22:05:27,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553586074] [2021-12-21 22:05:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2021-12-21 22:05:27,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224633473] [2021-12-21 22:05:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 123354080, now seen corresponding path program 1 times [2021-12-21 22:05:27,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015225849] [2021-12-21 22:05:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:05:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:05:27,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015225849] [2021-12-21 22:05:27,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015225849] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:05:27,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143501439] [2021-12-21 22:05:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:05:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:05:27,197 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:05:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 22:05:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:05:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 22:05:27,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:05:27,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 22:05:27,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 22:05:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:05:27,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 22:05:27,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-12-21 22:05:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143501439] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:05:27,441 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:05:27,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2021-12-21 22:05:27,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563764720] [2021-12-21 22:05:27,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:05:27,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:05:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 22:05:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-12-21 22:05:27,470 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 13 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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-12-21 22:05:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:05:27,617 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2021-12-21 22:05:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 22:05:27,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2021-12-21 22:05:27,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:05:27,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 48 transitions. [2021-12-21 22:05:27,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-21 22:05:27,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-21 22:05:27,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2021-12-21 22:05:27,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:05:27,619 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2021-12-21 22:05:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2021-12-21 22:05:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-12-21 22:05:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:05:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2021-12-21 22:05:27,621 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-21 22:05:27,621 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-21 22:05:27,621 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:05:27,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2021-12-21 22:05:27,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:05:27,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:05:27,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:05:27,622 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:05:27,622 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:05:27,622 INFO L791 eck$LassoCheckResult]: Stem: 925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 933#L367 assume !(main_~length~0#1 < 1); 927#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 928#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 929#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 934#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 946#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 935#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 936#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 938#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 940#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 930#L370-4 main_~j~0#1 := 0; 931#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 945#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 943#L378-2 [2021-12-21 22:05:27,623 INFO L793 eck$LassoCheckResult]: Loop: 943#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 942#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 943#L378-2 [2021-12-21 22:05:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2021-12-21 22:05:27,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337527779] [2021-12-21 22:05:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2021-12-21 22:05:27,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151439067] [2021-12-21 22:05:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,645 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:27,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2021-12-21 22:05:27,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627541114] [2021-12-21 22:05:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:27,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:05:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:05:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627541114] [2021-12-21 22:05:27,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627541114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:05:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989576621] [2021-12-21 22:05:27,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:05:27,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:05:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:05:27,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:05:27,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 22:05:27,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:05:27,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:05:27,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 22:05:27,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:05:27,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 22:05:27,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 22:05:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:05:27,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 22:05:27,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-12-21 22:05:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:27,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989576621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:05:27,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:05:27,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2021-12-21 22:05:27,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549983663] [2021-12-21 22:05:27,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:05:27,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:05:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 22:05:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-21 22:05:27,990 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 14 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:05:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:05:28,078 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2021-12-21 22:05:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 22:05:28,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2021-12-21 22:05:28,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:05:28,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 62 transitions. [2021-12-21 22:05:28,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-21 22:05:28,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-21 22:05:28,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2021-12-21 22:05:28,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:05:28,080 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-21 22:05:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2021-12-21 22:05:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2021-12-21 22:05:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:05:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2021-12-21 22:05:28,082 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2021-12-21 22:05:28,082 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2021-12-21 22:05:28,082 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:05:28,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 52 transitions. [2021-12-21 22:05:28,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:05:28,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:05:28,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:05:28,083 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:05:28,083 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:05:28,083 INFO L791 eck$LassoCheckResult]: Stem: 1121#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1129#L367 assume !(main_~length~0#1 < 1); 1123#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1124#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1125#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1130#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1139#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1131#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1132#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1133#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1155#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1149#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1150#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1146#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1143#L370-4 main_~j~0#1 := 0; 1141#L378-2 [2021-12-21 22:05:28,083 INFO L793 eck$LassoCheckResult]: Loop: 1141#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1142#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1141#L378-2 [2021-12-21 22:05:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1518446116, now seen corresponding path program 2 times [2021-12-21 22:05:28,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:28,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139200492] [2021-12-21 22:05:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:28,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:28,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:28,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2021-12-21 22:05:28,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:28,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953146389] [2021-12-21 22:05:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:28,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:28,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:05:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:05:28,098 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:05:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:05:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1062164511, now seen corresponding path program 2 times [2021-12-21 22:05:28,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:05:28,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891707229] [2021-12-21 22:05:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:05:28,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:05:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:05:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:28,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:05:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891707229] [2021-12-21 22:05:28,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891707229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:05:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183114339] [2021-12-21 22:05:28,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:05:28,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:05:28,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:05:28,232 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:05:28,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 22:05:28,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:05:28,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:05:28,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 22:05:28,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:05:28,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 22:05:28,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:05:28,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:05:28,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:05:28,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:05:28,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:05:28,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:05:28,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:05:28,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 22:05:28,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 22:05:28,462 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:05:28,462 INFO L387 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 19 treesize of output 10 [2021-12-21 22:05:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:05:28,470 INFO L328 TraceCheckSpWp]: Computing backward predicates...