./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78c6753a189c9cd2a3a6780fd233a43244cd2f3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:36:20,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:36:20,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:36:20,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:36:20,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:36:20,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:36:20,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:36:20,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:36:20,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:36:20,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:36:20,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:36:20,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:36:20,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:36:20,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:36:20,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:36:20,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:36:20,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:36:20,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:36:20,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:36:20,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:36:20,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:36:20,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:36:20,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:36:20,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:36:20,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:36:20,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:36:20,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:36:20,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:36:20,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:36:20,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:36:20,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:36:20,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:36:20,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:36:20,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:36:20,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:36:20,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:36:20,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:36:20,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:36:20,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:36:20,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:36:20,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:36:20,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:36:20,920 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:36:20,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:36:20,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:36:20,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:36:20,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:36:20,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:36:20,927 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:36:20,927 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:36:20,928 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:36:20,928 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:36:20,928 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:36:20,929 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:36:20,929 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:36:20,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:36:20,929 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:36:20,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:36:20,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:36:20,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:36:20,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:36:20,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:36:20,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:36:20,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:36:20,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:36:20,934 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b78c6753a189c9cd2a3a6780fd233a43244cd2f3 [2021-08-27 17:36:21,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:36:21,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:36:21,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:36:21,280 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:36:21,281 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:36:21,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum10-1.i [2021-08-27 17:36:21,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21facb7bd/c2c35b13681242eb8e58b5335bd9833f/FLAGed63bd554 [2021-08-27 17:36:21,831 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:36:21,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2021-08-27 17:36:21,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21facb7bd/c2c35b13681242eb8e58b5335bd9833f/FLAGed63bd554 [2021-08-27 17:36:22,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21facb7bd/c2c35b13681242eb8e58b5335bd9833f [2021-08-27 17:36:22,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:36:22,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:36:22,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:36:22,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:36:22,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:36:22,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ee672c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22, skipping insertion in model container [2021-08-27 17:36:22,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:36:22,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:36:22,475 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i[1277,1290] [2021-08-27 17:36:22,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:36:22,483 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:36:22,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i[1277,1290] [2021-08-27 17:36:22,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:36:22,512 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:36:22,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22 WrapperNode [2021-08-27 17:36:22,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:36:22,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:36:22,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:36:22,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:36:22,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:36:22,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:36:22,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:36:22,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:36:22,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:36:22,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:36:22,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:36:22,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:36:22,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (1/1) ... [2021-08-27 17:36:22,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:22,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:22,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:22,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:36:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:36:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:36:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:36:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:36:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:36:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:36:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:36:22,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:36:22,875 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-27 17:36:22,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:22 BoogieIcfgContainer [2021-08-27 17:36:22,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:36:22,878 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:36:22,878 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:36:22,880 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:36:22,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:22,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:36:22" (1/3) ... [2021-08-27 17:36:22,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7da37d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:36:22, skipping insertion in model container [2021-08-27 17:36:22,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:22,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:22" (2/3) ... [2021-08-27 17:36:22,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7da37d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:36:22, skipping insertion in model container [2021-08-27 17:36:22,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:22,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:22" (3/3) ... [2021-08-27 17:36:22,884 INFO L389 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2021-08-27 17:36:22,931 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:36:22,932 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:36:22,932 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:36:22,932 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:36:22,932 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:36:22,932 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:36:22,932 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:36:22,932 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:36:22,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:22,984 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-08-27 17:36:22,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:22,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:22,998 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:36:22,999 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:22,999 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:36:22,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:23,004 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-08-27 17:36:23,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:23,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:23,005 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:36:23,005 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:23,011 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 15#L34-3true [2021-08-27 17:36:23,012 INFO L793 eck$LassoCheckResult]: Loop: 15#L34-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 11#L34-2true main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 15#L34-3true [2021-08-27 17:36:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:36:23,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:23,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396434027] [2021-08-27 17:36:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:23,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,134 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,189 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 17:36:23,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:23,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599201201] [2021-08-27 17:36:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:23,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,212 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,232 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:23,237 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 17:36:23,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:23,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366610137] [2021-08-27 17:36:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:23,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,260 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:23,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:23,766 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:36:23,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:36:23,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:36:23,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:36:23,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:36:23,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:23,768 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:36:23,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:36:23,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2021-08-27 17:36:23,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:36:23,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:36:23,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,198 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:36:24,202 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:36:24,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,209 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-08-27 17:36:24,217 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-08-27 17:36:24,218 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-08-27 17:36:24,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,255 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,257 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-08-27 17:36:24,263 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-08-27 17:36:24,268 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-08-27 17:36:24,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,323 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-08-27 17:36:24,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,329 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-08-27 17:36:24,331 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-08-27 17:36:24,333 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-08-27 17:36:24,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,373 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-08-27 17:36:24,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,374 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-08-27 17:36:24,375 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-08-27 17:36:24,376 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-08-27 17:36:24,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,427 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-08-27 17:36:24,428 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,429 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-08-27 17:36:24,435 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-08-27 17:36:24,435 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-08-27 17:36:24,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,475 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-08-27 17:36:24,475 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,476 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-08-27 17:36:24,477 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-08-27 17:36:24,478 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-08-27 17:36:24,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 17:36:24,513 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,514 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-08-27 17:36:24,515 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-08-27 17:36:24,516 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-08-27 17:36:24,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,578 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-08-27 17:36:24,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,586 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-08-27 17:36:24,587 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-08-27 17:36:24,590 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-08-27 17:36:24,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,625 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-08-27 17:36:24,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,627 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-08-27 17:36:24,627 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-08-27 17:36:24,629 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-08-27 17:36:24,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,667 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-08-27 17:36:24,667 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:36:24,671 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-08-27 17:36:24,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,706 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:36:24,710 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-08-27 17:36:24,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:24,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:24,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:24,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,744 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,745 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:36:24,747 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-08-27 17:36:24,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 17:36:24,777 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-08-27 17:36:24,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,839 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:36:24,846 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-08-27 17:36:24,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:24,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:24,894 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,894 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:36:24,897 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-08-27 17:36:24,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:24,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:24,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:24,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:24,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:24,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:24,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:36:24,941 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-27 17:36:24,941 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 17:36:24,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:24,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:36:25,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:36:25,054 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:36:25,054 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:36:25,055 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-27 17:36:25,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,106 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:36:25,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:36:25,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,201 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:25,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,253 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-08-27 17:36:25,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 92 transitions. Complement of second has 8 states. [2021-08-27 17:36:25,325 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-08-27 17:36:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2021-08-27 17:36:25,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 17:36:25,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:25,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:36:25,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:25,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 17:36:25,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:25,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2021-08-27 17:36:25,332 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2021-08-27 17:36:25,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-08-27 17:36:25,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:25,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-08-27 17:36:25,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:25,337 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-08-27 17:36:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-08-27 17:36:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-08-27 17:36:25,356 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:25,357 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:25,357 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:36:25,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2021-08-27 17:36:25,357 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:25,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:25,358 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:36:25,358 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:25,358 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 160#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 171#L34-3 assume !(main_~i~1 < 10); 163#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 164#L20-3 [2021-08-27 17:36:25,358 INFO L793 eck$LassoCheckResult]: Loop: 164#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 177#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 164#L20-3 [2021-08-27 17:36:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 17:36:25,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258286279] [2021-08-27 17:36:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:25,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258286279] [2021-08-27 17:36:25,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258286279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:25,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:36:25,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:36:25,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734319456] [2021-08-27 17:36:25,397 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-08-27 17:36:25,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618642554] [2021-08-27 17:36:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,402 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:25,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:36:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:36:25,464 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:25,475 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-08-27 17:36:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:36:25,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2021-08-27 17:36:25,478 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2021-08-27 17:36:25,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:25,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:25,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-08-27 17:36:25,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:25,478 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-27 17:36:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-08-27 17:36:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 17:36:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-08-27 17:36:25,480 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-08-27 17:36:25,480 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-08-27 17:36:25,480 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:36:25,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-08-27 17:36:25,481 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:25,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:25,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:36:25,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:25,482 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 207#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 216#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 219#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 220#L34-3 assume !(main_~i~1 < 10); 208#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 209#L20-3 [2021-08-27 17:36:25,482 INFO L793 eck$LassoCheckResult]: Loop: 209#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 222#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 209#L20-3 [2021-08-27 17:36:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 17:36:25,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922719251] [2021-08-27 17:36:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:25,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922719251] [2021-08-27 17:36:25,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922719251] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:25,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773899430] [2021-08-27 17:36:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,512 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 17:36:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:36:25,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773899430] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:25,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:25,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:36:25,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000584775] [2021-08-27 17:36:25,608 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-08-27 17:36:25,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355478487] [2021-08-27 17:36:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,617 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,628 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:25,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:36:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:36:25,671 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:25,687 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-08-27 17:36:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:36:25,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2021-08-27 17:36:25,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2021-08-27 17:36:25,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:25,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:25,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2021-08-27 17:36:25,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:25,692 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-08-27 17:36:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2021-08-27 17:36:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-27 17:36:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-08-27 17:36:25,698 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 17:36:25,698 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 17:36:25,698 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:36:25,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-08-27 17:36:25,700 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:25,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:25,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:36:25,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:25,701 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 271#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 280#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 287#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 288#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 284#L34-3 assume !(main_~i~1 < 10); 272#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 273#L20-3 [2021-08-27 17:36:25,701 INFO L793 eck$LassoCheckResult]: Loop: 273#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 286#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 273#L20-3 [2021-08-27 17:36:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 17:36:25,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151710323] [2021-08-27 17:36:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:25,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151710323] [2021-08-27 17:36:25,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151710323] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:25,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760067786] [2021-08-27 17:36:25,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:25,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,769 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 17:36:25,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:25,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:25,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:25,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:25,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760067786] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:25,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:25,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:36:25,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994483459] [2021-08-27 17:36:25,888 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-08-27 17:36:25,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973101032] [2021-08-27 17:36:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,895 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:25,904 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:25,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:36:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:36:25,949 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:25,971 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-08-27 17:36:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:36:25,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2021-08-27 17:36:25,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2021-08-27 17:36:25,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:25,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:25,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2021-08-27 17:36:25,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:25,975 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-08-27 17:36:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2021-08-27 17:36:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-08-27 17:36:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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-08-27 17:36:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-08-27 17:36:25,978 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-27 17:36:25,978 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-27 17:36:25,978 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:36:25,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2021-08-27 17:36:25,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:25,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:25,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:25,981 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:36:25,981 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:25,981 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 346#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 355#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 362#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 363#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 358#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 359#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 365#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 364#L34-3 assume !(main_~i~1 < 10); 347#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 348#L20-3 [2021-08-27 17:36:25,981 INFO L793 eck$LassoCheckResult]: Loop: 348#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 361#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 348#L20-3 [2021-08-27 17:36:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 17:36:25,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:25,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725904855] [2021-08-27 17:36:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:25,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:26,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725904855] [2021-08-27 17:36:26,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725904855] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823632008] [2021-08-27 17:36:26,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:36:26,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:26,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,058 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 17:36:26,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:36:26,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:26,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:36:26,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823632008] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:26,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:36:26,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245675665] [2021-08-27 17:36:26,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-08-27 17:36:26,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521141685] [2021-08-27 17:36:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,180 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:26,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:26,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:36:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:36:26,236 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:26,267 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-08-27 17:36:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:36:26,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2021-08-27 17:36:26,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2021-08-27 17:36:26,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:26,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:26,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2021-08-27 17:36:26,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:26,270 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-08-27 17:36:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2021-08-27 17:36:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 17:36:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-08-27 17:36:26,272 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 17:36:26,273 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 17:36:26,273 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:36:26,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-08-27 17:36:26,274 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:26,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:26,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:36:26,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:26,275 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 430#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 441#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 448#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 449#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 444#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 445#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 453#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 452#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 451#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 450#L34-3 assume !(main_~i~1 < 10); 433#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 434#L20-3 [2021-08-27 17:36:26,275 INFO L793 eck$LassoCheckResult]: Loop: 434#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 447#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 434#L20-3 [2021-08-27 17:36:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 17:36:26,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751626021] [2021-08-27 17:36:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:26,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751626021] [2021-08-27 17:36:26,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751626021] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38761706] [2021-08-27 17:36:26,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:36:26,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,352 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 17:36:26,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:36:26,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:26,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:26,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38761706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:26,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:36:26,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899466655] [2021-08-27 17:36:26,472 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2021-08-27 17:36:26,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243636670] [2021-08-27 17:36:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,476 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:26,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:36:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:36:26,534 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:26,559 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-08-27 17:36:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:36:26,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-08-27 17:36:26,560 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2021-08-27 17:36:26,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:26,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:26,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-08-27 17:36:26,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:26,563 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-27 17:36:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-08-27 17:36:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-08-27 17:36:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-08-27 17:36:26,569 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-27 17:36:26,569 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-27 17:36:26,569 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:36:26,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2021-08-27 17:36:26,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:26,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:26,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 17:36:26,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:26,572 INFO L791 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 529#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 538#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 545#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 546#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 541#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 542#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 552#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 551#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 550#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 549#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 548#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 547#L34-3 assume !(main_~i~1 < 10); 530#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 531#L20-3 [2021-08-27 17:36:26,572 INFO L793 eck$LassoCheckResult]: Loop: 531#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 544#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 531#L20-3 [2021-08-27 17:36:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 17:36:26,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431161571] [2021-08-27 17:36:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:26,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431161571] [2021-08-27 17:36:26,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431161571] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250857470] [2021-08-27 17:36:26,658 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:36:26,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,661 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 17:36:26,732 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 17:36:26,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:26,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:36:26,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250857470] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:26,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 17:36:26,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396752602] [2021-08-27 17:36:26,809 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2021-08-27 17:36:26,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723716570] [2021-08-27 17:36:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,813 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:26,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:26,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:26,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:36:26,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:36:26,854 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:26,882 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-08-27 17:36:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:36:26,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2021-08-27 17:36:26,884 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2021-08-27 17:36:26,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:26,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:26,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2021-08-27 17:36:26,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:26,885 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-08-27 17:36:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2021-08-27 17:36:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-08-27 17:36:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 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-08-27 17:36:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-08-27 17:36:26,890 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-27 17:36:26,890 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-27 17:36:26,890 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:36:26,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2021-08-27 17:36:26,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:26,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:26,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:26,891 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2021-08-27 17:36:26,891 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:26,892 INFO L791 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 635#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 646#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 653#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 654#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 649#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 650#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 662#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 661#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 660#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 659#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 658#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 657#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 656#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 655#L34-3 assume !(main_~i~1 < 10); 638#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 639#L20-3 [2021-08-27 17:36:26,892 INFO L793 eck$LassoCheckResult]: Loop: 639#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 652#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 639#L20-3 [2021-08-27 17:36:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2021-08-27 17:36:26,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:26,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60897063] [2021-08-27 17:36:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:26,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:26,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60897063] [2021-08-27 17:36:26,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60897063] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:26,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021710401] [2021-08-27 17:36:26,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:36:26,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:26,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,972 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 17:36:27,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 17:36:27,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:27,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:36:27,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:27,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021710401] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:27,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:27,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 17:36:27,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166368431] [2021-08-27 17:36:27,146 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2021-08-27 17:36:27,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000960568] [2021-08-27 17:36:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,154 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:27,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:36:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:36:27,198 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:27,227 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-08-27 17:36:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:36:27,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2021-08-27 17:36:27,228 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2021-08-27 17:36:27,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:27,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:27,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2021-08-27 17:36:27,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:27,231 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-08-27 17:36:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2021-08-27 17:36:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-08-27 17:36:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-08-27 17:36:27,233 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-08-27 17:36:27,233 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-08-27 17:36:27,233 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:36:27,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2021-08-27 17:36:27,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:27,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:27,236 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2021-08-27 17:36:27,236 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:27,236 INFO L791 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 754#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 765#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 772#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 773#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 768#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 769#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 783#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 782#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 781#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 780#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 779#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 778#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 777#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 776#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 775#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 774#L34-3 assume !(main_~i~1 < 10); 757#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 758#L20-3 [2021-08-27 17:36:27,236 INFO L793 eck$LassoCheckResult]: Loop: 758#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 771#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 758#L20-3 [2021-08-27 17:36:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2021-08-27 17:36:27,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944039315] [2021-08-27 17:36:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:27,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:27,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944039315] [2021-08-27 17:36:27,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944039315] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:27,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209157495] [2021-08-27 17:36:27,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:36:27,337 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:27,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:27,384 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:27,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-27 17:36:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:27,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:36:27,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:27,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209157495] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:27,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:27,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 17:36:27,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635569682] [2021-08-27 17:36:27,540 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2021-08-27 17:36:27,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039024049] [2021-08-27 17:36:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,543 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,545 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:27,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:36:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:36:27,593 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:27,631 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-08-27 17:36:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:36:27,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2021-08-27 17:36:27,633 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2021-08-27 17:36:27,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:27,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:27,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2021-08-27 17:36:27,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:27,636 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-08-27 17:36:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2021-08-27 17:36:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-08-27 17:36:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 32 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-08-27 17:36:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-08-27 17:36:27,640 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-27 17:36:27,640 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-27 17:36:27,640 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:36:27,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2021-08-27 17:36:27,641 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:27,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:27,641 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2021-08-27 17:36:27,641 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:27,642 INFO L791 eck$LassoCheckResult]: Stem: 883#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 884#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 895#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 902#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 903#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 898#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 899#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 915#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 914#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 913#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 912#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 911#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 910#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 909#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 908#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 907#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 906#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 905#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 904#L34-3 assume !(main_~i~1 < 10); 887#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 888#L20-3 [2021-08-27 17:36:27,642 INFO L793 eck$LassoCheckResult]: Loop: 888#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 901#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 888#L20-3 [2021-08-27 17:36:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2021-08-27 17:36:27,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719677518] [2021-08-27 17:36:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:27,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:27,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719677518] [2021-08-27 17:36:27,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719677518] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:27,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588490363] [2021-08-27 17:36:27,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:27,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:27,737 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:27,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 17:36:27,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:27,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:27,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:36:27,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:27,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588490363] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:27,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:27,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 17:36:27,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668911332] [2021-08-27 17:36:27,900 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2021-08-27 17:36:27,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474121656] [2021-08-27 17:36:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,904 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:27,906 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:27,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:36:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:36:27,945 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:27,974 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-08-27 17:36:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:36:27,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2021-08-27 17:36:27,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2021-08-27 17:36:27,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:27,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:27,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2021-08-27 17:36:27,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:27,976 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-08-27 17:36:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2021-08-27 17:36:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-08-27 17:36:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-08-27 17:36:27,978 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-08-27 17:36:27,978 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-08-27 17:36:27,978 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:36:27,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2021-08-27 17:36:27,978 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:27,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:27,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:27,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2021-08-27 17:36:27,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:27,979 INFO L791 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1025#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1036#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1043#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1039#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1040#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1058#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1057#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1056#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1055#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1054#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1053#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1052#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1051#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1050#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1049#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1048#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1047#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1046#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1045#L34-3 assume !(main_~i~1 < 10); 1028#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1029#L20-3 [2021-08-27 17:36:27,979 INFO L793 eck$LassoCheckResult]: Loop: 1029#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1042#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1029#L20-3 [2021-08-27 17:36:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2021-08-27 17:36:27,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:27,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977871670] [2021-08-27 17:36:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:27,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:28,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:28,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977871670] [2021-08-27 17:36:28,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977871670] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:28,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236041633] [2021-08-27 17:36:28,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:36:28,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:28,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:28,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-27 17:36:28,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 17:36:28,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:28,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:36:28,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:28,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236041633] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:28,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:28,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 17:36:28,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906876429] [2021-08-27 17:36:28,289 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2021-08-27 17:36:28,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:28,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581734663] [2021-08-27 17:36:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:28,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,293 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:28,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:36:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:36:28,333 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-08-27 17:36:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:28,364 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-08-27 17:36:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:36:28,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2021-08-27 17:36:28,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:28,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2021-08-27 17:36:28,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:28,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:28,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2021-08-27 17:36:28,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:28,366 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-08-27 17:36:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2021-08-27 17:36:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-08-27 17:36:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2021-08-27 17:36:28,368 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-08-27 17:36:28,368 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-08-27 17:36:28,368 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:36:28,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2021-08-27 17:36:28,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:28,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:28,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:28,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-08-27 17:36:28,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:28,369 INFO L791 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1178#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1187#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1194#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1195#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1190#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1191#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1211#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1210#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1209#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1208#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1207#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1206#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1205#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1204#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1203#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1202#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1201#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1200#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1199#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1198#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1197#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1196#L34-3 assume !(main_~i~1 < 10); 1179#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1180#L20-3 [2021-08-27 17:36:28,369 INFO L793 eck$LassoCheckResult]: Loop: 1180#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1193#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1180#L20-3 [2021-08-27 17:36:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2021-08-27 17:36:28,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:28,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813208220] [2021-08-27 17:36:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:28,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,379 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,400 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2021-08-27 17:36:28,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:28,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303057228] [2021-08-27 17:36:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:28,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,404 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2021-08-27 17:36:28,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:28,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079683044] [2021-08-27 17:36:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:28,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,418 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:28,431 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:33,706 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:36:33,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:36:33,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:36:33,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:36:33,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:36:33,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:33,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:36:33,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:36:33,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration12_Lasso [2021-08-27 17:36:33,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:36:33,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:36:33,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:33,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:34,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:36:34,430 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:36:34,431 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,432 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 17:36:34,435 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-08-27 17:36:34,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,474 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 17:36:34,476 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-08-27 17:36:34,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,501 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 17:36:34,508 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-08-27 17:36:34,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,533 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 17:36:34,535 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-08-27 17:36:34,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:34,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:34,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,574 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 17:36:34,576 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-08-27 17:36:34,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,600 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,601 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 17:36:34,603 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-08-27 17:36:34,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-27 17:36:34,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,633 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 17:36:34,635 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-08-27 17:36:34,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 17:36:34,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,660 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:36:34,661 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-08-27 17:36:34,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,721 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:36:34,723 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-08-27 17:36:34,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 17:36:34,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,757 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 17:36:34,759 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-08-27 17:36:34,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-27 17:36:34,787 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,788 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 17:36:34,790 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-08-27 17:36:34,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:34,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:34,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-08-27 17:36:34,830 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,831 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:36:34,833 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-08-27 17:36:34,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 17:36:34,857 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,858 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:36:34,862 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-08-27 17:36:34,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:34,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:34,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 17:36:34,887 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,888 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:36:34,890 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-08-27 17:36:34,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:34,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:34,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,929 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:36:34,931 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-08-27 17:36:34,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:34,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:34,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:34,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:34,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:34,960 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:34,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:36:34,962 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-08-27 17:36:34,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:34,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:34,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:34,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:34,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:34,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:34,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:34,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,018 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,019 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:36:35,028 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-08-27 17:36:35,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-27 17:36:35,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,061 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:36:35,063 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-08-27 17:36:35,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,097 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:36:35,099 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-08-27 17:36:35,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 17:36:35,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,126 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:36:35,128 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-08-27 17:36:35,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,183 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,185 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:36:35,188 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-08-27 17:36:35,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-27 17:36:35,228 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,229 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 17:36:35,231 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-08-27 17:36:35,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-08-27 17:36:35,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,269 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 17:36:35,271 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-08-27 17:36:35,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:35,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:35,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:35,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,310 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,310 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 17:36:35,312 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-08-27 17:36:35,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-08-27 17:36:35,354 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,355 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 17:36:35,357 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-08-27 17:36:35,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:35,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,404 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,405 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,418 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-08-27 17:36:35,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:35,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:35,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:35,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:35,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:35,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:35,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 17:36:35,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:36:35,459 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 17:36:35,460 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-08-27 17:36:35,460 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,461 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 17:36:35,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:36:35,480 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:36:35,480 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:36:35,480 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2021-08-27 17:36:35,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,527 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 17:36:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:35,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:36:35,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:35,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:35,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:35,658 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-08-27 17:36:35,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 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-08-27 17:36:35,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. 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 41 states and 48 transitions. Complement of second has 7 states. [2021-08-27 17:36:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:36:35,672 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-08-27 17:36:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-27 17:36:35,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2021-08-27 17:36:35,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:35,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2021-08-27 17:36:35,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:35,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2021-08-27 17:36:35,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:35,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2021-08-27 17:36:35,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:35,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2021-08-27 17:36:35,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-08-27 17:36:35,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-08-27 17:36:35,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2021-08-27 17:36:35,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:35,675 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-08-27 17:36:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2021-08-27 17:36:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-27 17:36:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 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-08-27 17:36:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-08-27 17:36:35,676 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-08-27 17:36:35,676 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-08-27 17:36:35,676 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:36:35,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2021-08-27 17:36:35,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:35,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:35,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:35,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:35,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:35,677 INFO L791 eck$LassoCheckResult]: Stem: 1399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1400#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1411#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1419#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1420#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1414#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1415#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1436#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1435#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1434#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1433#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1432#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1431#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1430#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1428#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1427#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1426#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1425#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1424#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1423#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1422#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1421#L34-3 assume !(main_~i~1 < 10); 1403#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1404#L20-3 assume !(sum_~i~0 < 10); 1412#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1413#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1409#L20-8 [2021-08-27 17:36:35,677 INFO L793 eck$LassoCheckResult]: Loop: 1409#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1410#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1409#L20-8 [2021-08-27 17:36:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2021-08-27 17:36:35,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:35,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490211997] [2021-08-27 17:36:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:35,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:36:35,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:35,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490211997] [2021-08-27 17:36:35,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490211997] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:35,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:36:35,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:36:35,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607502724] [2021-08-27 17:36:35,707 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2021-08-27 17:36:35,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:35,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014301586] [2021-08-27 17:36:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:35,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:35,711 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:35,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:35,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:35,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:36:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:36:35,782 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:35,799 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-08-27 17:36:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:36:35,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2021-08-27 17:36:35,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:35,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2021-08-27 17:36:35,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:36:35,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:36:35,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2021-08-27 17:36:35,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:35,801 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-08-27 17:36:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2021-08-27 17:36:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-08-27 17:36:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 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-08-27 17:36:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-08-27 17:36:35,803 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-08-27 17:36:35,803 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-08-27 17:36:35,803 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:36:35,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2021-08-27 17:36:35,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:35,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:35,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:35,805 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:35,805 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:35,805 INFO L791 eck$LassoCheckResult]: Stem: 1488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1489#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1498#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1501#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1502#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1507#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1524#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1523#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1522#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1521#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1520#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1519#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1518#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1517#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1516#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1515#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1514#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1513#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1512#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1511#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1510#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1509#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1508#L34-3 assume !(main_~i~1 < 10); 1490#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1491#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1504#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1505#L20-3 assume !(sum_~i~0 < 10); 1499#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1500#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1496#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1497#L20-7 [2021-08-27 17:36:35,805 INFO L793 eck$LassoCheckResult]: Loop: 1497#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1506#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1497#L20-7 [2021-08-27 17:36:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2021-08-27 17:36:35,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:35,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315739059] [2021-08-27 17:36:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:35,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:36:35,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:35,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315739059] [2021-08-27 17:36:35,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315739059] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:35,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175614358] [2021-08-27 17:36:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:35,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:35,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:35,845 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:35,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-08-27 17:36:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:36,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:36:36,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:36:36,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175614358] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:36,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:36,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:36:36,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541890883] [2021-08-27 17:36:36,085 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2021-08-27 17:36:36,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:36,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419757776] [2021-08-27 17:36:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,093 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:36,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:36:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:36:36,143 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:36,178 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-08-27 17:36:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:36:36,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2021-08-27 17:36:36,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2021-08-27 17:36:36,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 17:36:36,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 17:36:36,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2021-08-27 17:36:36,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:36,181 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-08-27 17:36:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2021-08-27 17:36:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2021-08-27 17:36:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2021-08-27 17:36:36,187 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-08-27 17:36:36,187 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-08-27 17:36:36,187 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:36:36,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2021-08-27 17:36:36,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:36,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:36,188 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:36,188 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:36,188 INFO L791 eck$LassoCheckResult]: Stem: 1669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1670#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1681#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1684#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1685#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1692#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1711#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1710#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1709#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1708#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1707#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1706#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1705#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1704#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1703#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1702#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1701#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1700#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1699#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1698#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1697#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1696#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1695#L34-3 assume !(main_~i~1 < 10); 1673#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1674#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1687#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1688#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1689#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1694#L20-3 assume !(sum_~i~0 < 10); 1682#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1683#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1690#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1691#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1679#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1680#L20-7 [2021-08-27 17:36:36,188 INFO L793 eck$LassoCheckResult]: Loop: 1680#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1693#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1680#L20-7 [2021-08-27 17:36:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2021-08-27 17:36:36,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:36,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668227311] [2021-08-27 17:36:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-27 17:36:36,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:36,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668227311] [2021-08-27 17:36:36,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668227311] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:36,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285030816] [2021-08-27 17:36:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:36,245 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-08-27 17:36:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:36,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:36,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-27 17:36:36,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285030816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:36,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:36,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:36:36,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322185982] [2021-08-27 17:36:36,468 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2021-08-27 17:36:36,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:36,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364857029] [2021-08-27 17:36:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,475 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,477 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:36,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:36:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:36:36,522 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:36,562 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-08-27 17:36:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:36:36,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2021-08-27 17:36:36,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2021-08-27 17:36:36,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 17:36:36,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 17:36:36,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2021-08-27 17:36:36,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:36,564 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-08-27 17:36:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2021-08-27 17:36:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2021-08-27 17:36:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2021-08-27 17:36:36,566 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2021-08-27 17:36:36,566 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2021-08-27 17:36:36,566 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 17:36:36,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2021-08-27 17:36:36,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:36,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:36,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:36,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:36,567 INFO L791 eck$LassoCheckResult]: Stem: 1875#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1876#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1887#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1890#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1891#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1899#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1918#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1917#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1916#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1915#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1914#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1913#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1912#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1911#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1910#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1909#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1908#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1907#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1906#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1905#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1904#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1903#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1902#L34-3 assume !(main_~i~1 < 10); 1879#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1880#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1893#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1921#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1896#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1894#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1895#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1901#L20-3 assume !(sum_~i~0 < 10); 1888#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1889#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1897#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1919#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1920#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1898#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1885#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1886#L20-7 [2021-08-27 17:36:36,567 INFO L793 eck$LassoCheckResult]: Loop: 1886#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1900#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1886#L20-7 [2021-08-27 17:36:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2021-08-27 17:36:36,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:36,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344075231] [2021-08-27 17:36:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-27 17:36:36,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:36,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344075231] [2021-08-27 17:36:36,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344075231] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:36,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428926678] [2021-08-27 17:36:36,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:36,619 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:36,621 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:36,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-08-27 17:36:36,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:36,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:36,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:36:36,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-27 17:36:36,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428926678] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:36,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:36,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:36:36,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543772048] [2021-08-27 17:36:36,887 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2021-08-27 17:36:36,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:36,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712055331] [2021-08-27 17:36:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:36,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,891 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:36,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:36,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:36:36,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:36:36,936 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:36,994 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-08-27 17:36:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:36:36,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2021-08-27 17:36:36,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2021-08-27 17:36:36,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-08-27 17:36:36,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-27 17:36:36,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2021-08-27 17:36:36,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:36,996 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-08-27 17:36:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2021-08-27 17:36:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2021-08-27 17:36:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-08-27 17:36:36,998 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-08-27 17:36:36,998 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-08-27 17:36:36,998 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 17:36:36,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2021-08-27 17:36:36,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:36,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:36,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:37,000 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:37,000 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:37,000 INFO L791 eck$LassoCheckResult]: Stem: 2106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2107#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2116#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2119#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2120#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2127#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2148#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2147#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2146#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2145#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2144#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2143#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2142#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2141#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2140#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2139#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2138#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2137#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2136#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2135#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2134#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2133#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2132#L34-3 assume !(main_~i~1 < 10); 2108#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2109#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2122#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2123#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2124#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2154#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2153#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2152#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2131#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2130#L20-3 assume !(sum_~i~0 < 10); 2117#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2118#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2125#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2126#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2114#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2115#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2151#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2150#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2149#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2129#L20-7 [2021-08-27 17:36:37,000 INFO L793 eck$LassoCheckResult]: Loop: 2129#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2128#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2129#L20-7 [2021-08-27 17:36:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2021-08-27 17:36:37,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:37,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992944191] [2021-08-27 17:36:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:37,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-08-27 17:36:37,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:37,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992944191] [2021-08-27 17:36:37,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992944191] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:37,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390844331] [2021-08-27 17:36:37,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:36:37,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:37,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:37,060 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:37,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-08-27 17:36:37,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 17:36:37,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:37,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:37,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-08-27 17:36:37,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390844331] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:37,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:37,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:36:37,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339950718] [2021-08-27 17:36:37,369 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2021-08-27 17:36:37,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:37,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898198352] [2021-08-27 17:36:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:37,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:37,373 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:37,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:37,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:36:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:36:37,416 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-08-27 17:36:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:37,488 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-08-27 17:36:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:36:37,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2021-08-27 17:36:37,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:37,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2021-08-27 17:36:37,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-27 17:36:37,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 17:36:37,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2021-08-27 17:36:37,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:37,490 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-08-27 17:36:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2021-08-27 17:36:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-08-27 17:36:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-08-27 17:36:37,492 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-08-27 17:36:37,492 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-08-27 17:36:37,492 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 17:36:37,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2021-08-27 17:36:37,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:37,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:37,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:37,493 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:37,493 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:37,493 INFO L791 eck$LassoCheckResult]: Stem: 2358#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2359#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2368#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2371#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2372#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2379#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2400#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2399#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2398#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2397#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2396#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2395#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2394#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2393#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2392#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2391#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2390#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2389#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2388#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2387#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2386#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2385#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2384#L34-3 assume !(main_~i~1 < 10); 2360#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2361#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2374#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2375#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2376#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2410#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2409#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2408#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2407#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2406#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2383#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2382#L20-3 assume !(sum_~i~0 < 10); 2369#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2370#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2377#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2378#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2366#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2367#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2405#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2404#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2403#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2402#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2401#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2381#L20-7 [2021-08-27 17:36:37,493 INFO L793 eck$LassoCheckResult]: Loop: 2381#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2380#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2381#L20-7 [2021-08-27 17:36:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:37,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2021-08-27 17:36:37,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:37,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695410797] [2021-08-27 17:36:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:37,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-08-27 17:36:37,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:37,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695410797] [2021-08-27 17:36:37,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695410797] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:37,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83201085] [2021-08-27 17:36:37,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:36:37,554 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:37,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:37,557 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:37,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-08-27 17:36:37,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:36:37,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:37,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:36:37,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-08-27 17:36:37,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83201085] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:37,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:37,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 17:36:37,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840222735] [2021-08-27 17:36:37,895 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2021-08-27 17:36:37,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:37,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938474971] [2021-08-27 17:36:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:37,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:37,899 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:37,900 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:37,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:36:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:36:37,934 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:38,009 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-08-27 17:36:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:36:38,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2021-08-27 17:36:38,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:38,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2021-08-27 17:36:38,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-08-27 17:36:38,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-08-27 17:36:38,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2021-08-27 17:36:38,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:38,011 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-08-27 17:36:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2021-08-27 17:36:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2021-08-27 17:36:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-08-27 17:36:38,013 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-08-27 17:36:38,013 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-08-27 17:36:38,013 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 17:36:38,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2021-08-27 17:36:38,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:38,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:38,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:38,014 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:38,014 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:38,014 INFO L791 eck$LassoCheckResult]: Stem: 2633#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2634#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2643#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2646#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2647#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2654#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2675#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2674#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2673#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2672#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2671#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2670#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2669#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2668#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2667#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2666#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2665#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2664#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2663#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2662#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2661#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2660#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2659#L34-3 assume !(main_~i~1 < 10); 2635#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2636#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2649#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2650#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2651#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2689#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2688#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2687#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2686#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2685#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2684#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2683#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2658#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2657#L20-3 assume !(sum_~i~0 < 10); 2644#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2645#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2652#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2653#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2641#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2642#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2682#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2681#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2680#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2679#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2678#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2677#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2676#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2656#L20-7 [2021-08-27 17:36:38,014 INFO L793 eck$LassoCheckResult]: Loop: 2656#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2655#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2656#L20-7 [2021-08-27 17:36:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2021-08-27 17:36:38,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:38,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300206217] [2021-08-27 17:36:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:38,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-08-27 17:36:38,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:38,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300206217] [2021-08-27 17:36:38,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300206217] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:38,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534860236] [2021-08-27 17:36:38,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:36:38,161 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:38,162 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:38,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-27 17:36:38,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-08-27 17:36:38,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:38,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:36:38,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-08-27 17:36:38,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534860236] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:38,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:38,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 17:36:38,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414463635] [2021-08-27 17:36:38,552 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2021-08-27 17:36:38,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:38,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599023668] [2021-08-27 17:36:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:38,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:38,556 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:38,558 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:38,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:36:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:36:38,605 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:38,704 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-08-27 17:36:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:36:38,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2021-08-27 17:36:38,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:38,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2021-08-27 17:36:38,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-27 17:36:38,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 17:36:38,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2021-08-27 17:36:38,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:38,707 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-08-27 17:36:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2021-08-27 17:36:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-08-27 17:36:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-08-27 17:36:38,715 INFO L704 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-08-27 17:36:38,715 INFO L587 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-08-27 17:36:38,715 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 17:36:38,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2021-08-27 17:36:38,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:38,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:38,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:38,718 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:38,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:38,719 INFO L791 eck$LassoCheckResult]: Stem: 2929#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 2930#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2941#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2944#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2945#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2951#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2972#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2971#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2970#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2969#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2968#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2967#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2966#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2965#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2964#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2963#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2962#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2961#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2960#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2959#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2958#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 2957#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 2956#L34-3 assume !(main_~i~1 < 10); 2933#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2934#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2947#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2948#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2949#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2991#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2990#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2989#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2987#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2985#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2983#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2981#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2979#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2977#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2955#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2954#L20-3 assume !(sum_~i~0 < 10); 2942#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2943#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2939#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2940#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2950#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2988#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2986#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2984#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2982#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2980#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2978#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2976#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2975#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2974#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2973#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2953#L20-7 [2021-08-27 17:36:38,719 INFO L793 eck$LassoCheckResult]: Loop: 2953#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 2952#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 2953#L20-7 [2021-08-27 17:36:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2021-08-27 17:36:38,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:38,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955700599] [2021-08-27 17:36:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:38,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-27 17:36:38,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:38,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955700599] [2021-08-27 17:36:38,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955700599] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:38,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409700426] [2021-08-27 17:36:38,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:36:38,825 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:38,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:38,826 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:38,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-27 17:36:39,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-08-27 17:36:39,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:39,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 17:36:39,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-08-27 17:36:39,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409700426] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:39,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:39,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2021-08-27 17:36:39,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075678154] [2021-08-27 17:36:39,478 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:39,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2021-08-27 17:36:39,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:39,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806947242] [2021-08-27 17:36:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:39,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:39,481 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:39,483 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:39,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:36:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:36:39,522 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:39,690 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-08-27 17:36:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:36:39,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2021-08-27 17:36:39,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:39,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2021-08-27 17:36:39,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-08-27 17:36:39,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-08-27 17:36:39,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2021-08-27 17:36:39,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:39,692 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-08-27 17:36:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2021-08-27 17:36:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2021-08-27 17:36:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-08-27 17:36:39,693 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-08-27 17:36:39,693 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-08-27 17:36:39,693 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 17:36:39,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2021-08-27 17:36:39,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:39,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:39,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:39,694 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:39,695 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:39,695 INFO L791 eck$LassoCheckResult]: Stem: 3270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3271#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3280#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3284#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3291#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3312#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3311#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3310#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3309#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3308#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3307#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3306#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3305#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3304#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3303#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3302#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3301#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3300#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3299#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3298#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3297#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3296#L34-3 assume !(main_~i~1 < 10); 3272#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3273#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3286#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3287#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3288#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3334#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3333#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3332#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3331#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3330#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3329#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3328#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3327#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3326#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3325#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3324#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3295#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3294#L20-3 assume !(sum_~i~0 < 10); 3281#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3282#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3289#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3290#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3278#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3279#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3323#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3322#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3321#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3320#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3319#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3318#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3317#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3316#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3315#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3314#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3313#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3293#L20-7 [2021-08-27 17:36:39,695 INFO L793 eck$LassoCheckResult]: Loop: 3293#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3292#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3293#L20-7 [2021-08-27 17:36:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2021-08-27 17:36:39,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:39,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307544890] [2021-08-27 17:36:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:39,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-08-27 17:36:39,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:39,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307544890] [2021-08-27 17:36:39,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307544890] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:39,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275607361] [2021-08-27 17:36:39,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:36:39,788 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:39,793 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:39,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-27 17:36:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:40,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:36:40,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-08-27 17:36:40,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275607361] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:40,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:40,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 17:36:40,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584705448] [2021-08-27 17:36:40,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2021-08-27 17:36:40,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:40,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719295249] [2021-08-27 17:36:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:40,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:40,233 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:40,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:40,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:36:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:36:40,277 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:40,363 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-08-27 17:36:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:36:40,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2021-08-27 17:36:40,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:40,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2021-08-27 17:36:40,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-27 17:36:40,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-08-27 17:36:40,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2021-08-27 17:36:40,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:40,365 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-08-27 17:36:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2021-08-27 17:36:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2021-08-27 17:36:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.056338028169014) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-08-27 17:36:40,367 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-08-27 17:36:40,367 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-08-27 17:36:40,367 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 17:36:40,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2021-08-27 17:36:40,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:40,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:40,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:40,370 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:40,370 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:40,370 INFO L791 eck$LassoCheckResult]: Stem: 3614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3615#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3624#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3627#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3628#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3635#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3656#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3655#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3654#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3653#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3652#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3651#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3650#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3649#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3648#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3647#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3646#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3645#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3644#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3643#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3642#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3641#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3640#L34-3 assume !(main_~i~1 < 10); 3616#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3617#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3630#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3631#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3632#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3682#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3681#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3680#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3679#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3678#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3677#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3676#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3675#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3674#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3673#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3672#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3671#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3670#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3639#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3638#L20-3 assume !(sum_~i~0 < 10); 3625#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3626#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3633#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3634#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3622#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3623#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3669#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3668#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3667#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3666#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3665#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3664#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3663#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3662#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3661#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3660#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3659#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3658#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3657#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3637#L20-7 [2021-08-27 17:36:40,371 INFO L793 eck$LassoCheckResult]: Loop: 3637#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3636#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3637#L20-7 [2021-08-27 17:36:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:40,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2021-08-27 17:36:40,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:40,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996470480] [2021-08-27 17:36:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:40,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-08-27 17:36:40,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:40,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996470480] [2021-08-27 17:36:40,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996470480] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:40,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027312112] [2021-08-27 17:36:40,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:40,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:40,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:40,485 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-27 17:36:40,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:40,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:40,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:36:40,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-08-27 17:36:40,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027312112] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:40,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:40,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 17:36:40,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714943475] [2021-08-27 17:36:40,950 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2021-08-27 17:36:40,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:40,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436800257] [2021-08-27 17:36:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:40,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:40,953 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:40,955 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:40,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:36:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:36:40,994 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:41,102 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-08-27 17:36:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:36:41,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2021-08-27 17:36:41,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:41,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2021-08-27 17:36:41,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-08-27 17:36:41,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-08-27 17:36:41,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2021-08-27 17:36:41,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:41,106 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-08-27 17:36:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2021-08-27 17:36:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2021-08-27 17:36:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2021-08-27 17:36:41,107 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-08-27 17:36:41,107 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-08-27 17:36:41,107 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 17:36:41,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2021-08-27 17:36:41,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:41,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:41,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:41,109 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:41,109 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:41,109 INFO L791 eck$LassoCheckResult]: Stem: 3976#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 3977#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3988#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3991#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 3992#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 3998#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4050#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4049#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4048#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4047#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4046#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4045#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4044#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4043#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4042#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4041#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4040#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4039#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4038#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4037#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4036#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4035#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4034#L34-3 assume !(main_~i~1 < 10); 3980#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3981#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3994#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3995#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3996#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4033#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4032#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4030#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4028#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4026#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4024#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4022#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4020#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4018#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4016#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4014#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4012#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4010#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4008#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4006#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4003#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4002#L20-3 assume !(sum_~i~0 < 10); 3989#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3990#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3986#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 3987#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3997#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4031#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4029#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4027#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4025#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4023#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4021#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4019#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4017#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4015#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4013#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4011#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4009#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4007#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4005#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4004#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4001#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4000#L20-7 [2021-08-27 17:36:41,109 INFO L793 eck$LassoCheckResult]: Loop: 4000#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 3999#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4000#L20-7 [2021-08-27 17:36:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2021-08-27 17:36:41,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:41,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774244755] [2021-08-27 17:36:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:41,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:41,201 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:41,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2021-08-27 17:36:41,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:41,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833475875] [2021-08-27 17:36:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:41,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:41,313 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:41,314 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2021-08-27 17:36:41,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:41,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670412085] [2021-08-27 17:36:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:41,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-27 17:36:41,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:41,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670412085] [2021-08-27 17:36:41,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670412085] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:41,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88642880] [2021-08-27 17:36:41,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:36:41,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:41,435 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:41,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-08-27 17:36:41,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:36:41,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:41,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 17:36:41,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-27 17:36:41,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88642880] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:41,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:36:41,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2021-08-27 17:36:41,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489419868] [2021-08-27 17:36:42,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:36:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2021-08-27 17:36:42,018 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:42,162 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2021-08-27 17:36:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 17:36:42,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2021-08-27 17:36:42,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:36:42,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2021-08-27 17:36:42,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-08-27 17:36:42,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-08-27 17:36:42,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2021-08-27 17:36:42,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:42,165 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-08-27 17:36:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2021-08-27 17:36:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-08-27 17:36:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-08-27 17:36:42,167 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-08-27 17:36:42,167 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-08-27 17:36:42,167 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 17:36:42,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2021-08-27 17:36:42,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:36:42,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:42,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:42,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:42,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:42,168 INFO L791 eck$LassoCheckResult]: Stem: 4365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 4366#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4375#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4383#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4384#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4378#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4379#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4436#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4435#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4434#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4433#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4432#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4431#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4430#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4429#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4428#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4427#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4426#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4425#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4424#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4423#L34-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 4422#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 4421#L34-3 assume !(main_~i~1 < 10); 4369#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4370#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4380#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4381#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4420#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4419#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4418#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4417#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4415#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4413#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4411#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4409#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4407#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4405#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4403#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4401#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4399#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4397#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4395#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4393#L20-3 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4391#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4389#L20-3 assume !(sum_~i~0 < 10); 4376#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4377#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4373#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4374#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4382#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4416#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4414#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4412#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4410#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4408#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4406#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4404#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4402#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4400#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4398#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4396#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4394#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4392#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4390#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4388#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4387#L20-8 assume !!(sum_~i~0 < 10);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 4386#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 4385#L20-8 assume !(sum_~i~0 < 10); 4367#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4368#L23-1 main_#t~ret10 := sum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 4372#L43-3 [2021-08-27 17:36:42,169 INFO L793 eck$LassoCheckResult]: Loop: 4372#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 4371#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 4372#L43-3 [2021-08-27 17:36:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2021-08-27 17:36:42,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:42,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142289417] [2021-08-27 17:36:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:42,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,269 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2021-08-27 17:36:42,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:42,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484105239] [2021-08-27 17:36:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:42,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,352 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2021-08-27 17:36:42,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:42,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378888421] [2021-08-27 17:36:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:42,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,451 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:42,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:00,810 WARN L207 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 617 DAG size of output: 424 [2021-08-27 17:37:05,708 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:05,708 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:05,708 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:05,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:05,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:05,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:05,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:05,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:05,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration24_Lasso [2021-08-27 17:37:05,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:05,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:05,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:07,820 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-08-27 17:37:08,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:08,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:08,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:09,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:09,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:09,722 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:37:09,722 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:37:09,722 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,725 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-08-27 17:37:09,727 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-08-27 17:37:09,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:09,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,751 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-08-27 17:37:09,753 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-08-27 17:37:09,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-08-27 17:37:09,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,777 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-08-27 17:37:09,780 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-08-27 17:37:09,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:09,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:09,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-08-27 17:37:09,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,806 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-08-27 17:37:09,808 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-08-27 17:37:09,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-08-27 17:37:09,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,832 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-08-27 17:37:09,834 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-08-27 17:37:09,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-08-27 17:37:09,857 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,858 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-27 17:37:09,859 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-08-27 17:37:09,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-08-27 17:37:09,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,884 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-27 17:37:09,888 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-08-27 17:37:09,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-08-27 17:37:09,912 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,913 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-27 17:37:09,915 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-08-27 17:37:09,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:09,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:09,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:09,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-27 17:37:09,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,939 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-27 17:37:09,941 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-08-27 17:37:09,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:09,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:09,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 17:37:09,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,967 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-27 17:37:09,969 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-08-27 17:37:09,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:09,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:09,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:09,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:09,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:09,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:09,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:09,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-27 17:37:09,994 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:09,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:09,995 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-27 17:37:09,997 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-08-27 17:37:10,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:10,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:10,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:10,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:10,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-08-27 17:37:10,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,041 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-08-27 17:37:10,043 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-08-27 17:37:10,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:10,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:10,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:10,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-08-27 17:37:10,068 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,069 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-08-27 17:37:10,071 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-08-27 17:37:10,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:10,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:10,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:10,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:10,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:10,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,097 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-27 17:37:10,099 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-08-27 17:37:10,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:10,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:10,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:10,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-27 17:37:10,139 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,140 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-08-27 17:37:10,142 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-08-27 17:37:10,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:10,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:10,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:10,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:10,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-08-27 17:37:10,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,168 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-08-27 17:37:10,170 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-08-27 17:37:10,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:10,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:10,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:10,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:10,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:10,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:10,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:37:10,246 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-08-27 17:37:10,246 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-08-27 17:37:10,247 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:10,248 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:10,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-08-27 17:37:10,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:37:10,255 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:37:10,256 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:37:10,256 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2021-08-27 17:37:10,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:10,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:10,778 INFO L297 tatePredicateManager]: 133 out of 133 supporting invariants were superfluous and have been removed [2021-08-27 17:37:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:10,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:37:10,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:11,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:37:11,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:11,070 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-08-27 17:37:11,070 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:11,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 74 states and 76 transitions. Complement of second has 4 states. [2021-08-27 17:37:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:37:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2021-08-27 17:37:11,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2021-08-27 17:37:11,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:11,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2021-08-27 17:37:11,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:11,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2021-08-27 17:37:11,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:11,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2021-08-27 17:37:11,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:37:11,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2021-08-27 17:37:11,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:37:11,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:37:11,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:37:11,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:37:11,081 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:37:11,082 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:37:11,082 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:37:11,082 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 17:37:11,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:37:11,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:37:11,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:37:11,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:37:11 BoogieIcfgContainer [2021-08-27 17:37:11,087 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:37:11,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:37:11,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:37:11,088 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:37:11,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:22" (3/4) ... [2021-08-27 17:37:11,090 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:37:11,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:37:11,091 INFO L168 Benchmark]: Toolchain (without parser) took 48774.38 ms. Allocated memory was 54.5 MB in the beginning and 362.8 MB in the end (delta: 308.3 MB). Free memory was 31.6 MB in the beginning and 108.4 MB in the end (delta: -76.9 MB). Peak memory consumption was 233.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:11,092 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:11,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.72 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 35.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:11,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.82 ms. Allocated memory is still 54.5 MB. Free memory was 35.2 MB in the beginning and 33.4 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:11,092 INFO L168 Benchmark]: Boogie Preprocessor took 20.73 ms. Allocated memory is still 54.5 MB. Free memory was 33.4 MB in the beginning and 32.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:11,093 INFO L168 Benchmark]: RCFGBuilder took 300.06 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.0 MB in the beginning and 40.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:11,093 INFO L168 Benchmark]: BuchiAutomizer took 48209.44 ms. Allocated memory was 67.1 MB in the beginning and 362.8 MB in the end (delta: 295.7 MB). Free memory was 40.4 MB in the beginning and 109.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 228.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:11,093 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 362.8 MB. Free memory was 109.5 MB in the beginning and 108.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:11,095 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 194.72 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 35.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.82 ms. Allocated memory is still 54.5 MB. Free memory was 35.2 MB in the beginning and 33.4 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.73 ms. Allocated memory is still 54.5 MB. Free memory was 33.4 MB in the beginning and 32.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 300.06 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.0 MB in the beginning and 40.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 48209.44 ms. Allocated memory was 67.1 MB in the beginning and 362.8 MB in the end (delta: 295.7 MB). Free memory was 40.4 MB in the beginning and 109.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 228.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.08 ms. Allocated memory is still 362.8 MB. Free memory was 109.5 MB in the beginning and 108.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 19 + -2 * i and consists of 4 locations. One deterministic module has affine ranking function 17 + -2 * i and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.1s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 46.0s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 70.7ms AutomataMinimizationTime, 23 MinimizatonAttempts, 136 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 75 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 410 SDtfs, 454 SDslu, 840 SDs, 0 SdLazy, 918 SolverSat, 311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 764.0ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1073 mio100 ax100 hnf99 lsp124 ukn39 mio100 lsp33 div94 bol100 ite100 ukn100 eq166 hnf88 smp97 dnf150 smp83 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:37:11,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:11,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2021-08-27 17:37:11,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2021-08-27 17:37:11,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2021-08-27 17:37:11,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2021-08-27 17:37:12,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2021-08-27 17:37:12,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2021-08-27 17:37:12,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2021-08-27 17:37:12,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2021-08-27 17:37:12,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:13,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-27 17:37:13,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-08-27 17:37:13,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:13,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-08-27 17:37:13,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-27 17:37:14,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:14,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:14,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-27 17:37:14,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-27 17:37:14,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...