./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:13:01,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:13:01,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:13:01,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:13:01,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:13:01,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:13:01,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:13:01,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:13:01,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:13:01,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:13:01,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:13:01,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:13:01,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:13:01,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:13:01,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:13:01,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:13:01,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:13:01,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:13:01,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:13:01,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:13:01,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:13:01,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:13:01,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:13:01,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:13:01,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:13:01,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:13:01,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:13:01,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:13:01,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:13:01,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:13:01,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:13:01,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:13:01,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:13:01,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:13:01,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:13:01,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:13:01,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:13:01,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:13:01,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:13:01,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:13:01,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:13:01,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-21 17:13:01,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:13:01,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:13:01,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:13:01,886 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:13:01,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:13:01,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:13:01,888 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:13:01,888 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 17:13:01,888 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 17:13:01,888 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 17:13:01,888 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 17:13:01,889 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 17:13:01,889 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 17:13:01,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:13:01,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:13:01,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:13:01,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:13:01,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 17:13:01,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 17:13:01,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 17:13:01,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:13:01,891 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 17:13:01,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:13:01,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 17:13:01,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:13:01,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:13:01,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:13:01,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:13:01,893 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 17:13:01,893 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 [2022-11-21 17:13:02,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:13:02,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:13:02,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:13:02,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:13:02,178 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:13:02,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-21 17:13:05,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:13:05,469 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:13:05,470 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-21 17:13:05,487 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/data/9206e2863/71bb7c7331d5491d81308a0c7f97c676/FLAGeb6c705ee [2022-11-21 17:13:05,503 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/data/9206e2863/71bb7c7331d5491d81308a0c7f97c676 [2022-11-21 17:13:05,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:13:05,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:13:05,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:13:05,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:13:05,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:13:05,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:05,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9b9d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05, skipping insertion in model container [2022-11-21 17:13:05,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:05,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:13:05,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:13:05,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:13:05,870 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:13:05,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:13:05,926 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:13:05,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05 WrapperNode [2022-11-21 17:13:05,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:13:05,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:13:05,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:13:05,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:13:05,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:05,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:05,985 INFO L138 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-11-21 17:13:05,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:13:05,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:13:05,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:13:05,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:13:05,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:05,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:13:06,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:13:06,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:13:06,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:13:06,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (1/1) ... [2022-11-21 17:13:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:06,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:06,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 17:13:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:13:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:13:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:13:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:13:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:13:06,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:13:06,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:13:06,321 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:13:06,327 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:13:06,327 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 17:13:06,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:13:06 BoogieIcfgContainer [2022-11-21 17:13:06,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:13:06,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 17:13:06,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 17:13:06,335 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 17:13:06,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:13:06,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 05:13:05" (1/3) ... [2022-11-21 17:13:06,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f9d919c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:13:06, skipping insertion in model container [2022-11-21 17:13:06,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:13:06,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:13:05" (2/3) ... [2022-11-21 17:13:06,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f9d919c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:13:06, skipping insertion in model container [2022-11-21 17:13:06,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:13:06,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:13:06" (3/3) ... [2022-11-21 17:13:06,340 INFO L332 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2022-11-21 17:13:06,399 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 17:13:06,400 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 17:13:06,400 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 17:13:06,400 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 17:13:06,400 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 17:13:06,400 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 17:13:06,401 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 17:13:06,401 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 17:13:06,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:06,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:06,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:06,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:06,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 17:13:06,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 17:13:06,432 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 17:13:06,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:06,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:06,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:06,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:06,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 17:13:06,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 17:13:06,443 INFO L748 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 12#L552true assume !main_#t~short9#1; 2#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 8#L556-2true [2022-11-21 17:13:06,443 INFO L750 eck$LassoCheckResult]: Loop: 8#L556-2true call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 11#L555-1true assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 7#L556true assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 8#L556-2true [2022-11-21 17:13:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2022-11-21 17:13:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128718915] [2022-11-21 17:13:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128718915] [2022-11-21 17:13:06,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128718915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:13:06,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:13:06,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:13:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042882400] [2022-11-21 17:13:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:13:06,826 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2022-11-21 17:13:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:06,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020830822] [2022-11-21 17:13:06,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:06,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:06,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:13:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:13:07,205 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) 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) [2022-11-21 17:13:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:13:07,233 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-11-21 17:13:07,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-11-21 17:13:07,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:07,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2022-11-21 17:13:07,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-21 17:13:07,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-21 17:13:07,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-11-21 17:13:07,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:13:07,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:13:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-11-21 17:13:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-21 17:13:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-11-21 17:13:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-11-21 17:13:07,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:13:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:13:07,285 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:13:07,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 17:13:07,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-11-21 17:13:07,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:07,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:07,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:07,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 17:13:07,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 17:13:07,288 INFO L748 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 40#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 34#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 35#L556-2 [2022-11-21 17:13:07,288 INFO L750 eck$LassoCheckResult]: Loop: 35#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 39#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 38#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 35#L556-2 [2022-11-21 17:13:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2022-11-21 17:13:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:07,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636314020] [2022-11-21 17:13:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2022-11-21 17:13:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:07,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45816461] [2022-11-21 17:13:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:07,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2022-11-21 17:13:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:07,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490946657] [2022-11-21 17:13:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:07,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:08,885 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:13:08,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:13:08,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:13:08,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:13:08,886 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:13:08,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:08,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:13:08,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:13:08,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration2_Lasso [2022-11-21 17:13:08,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:13:08,887 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:13:08,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,916 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,918 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,921 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,924 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,926 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,929 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,932 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,935 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,940 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,943 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,948 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,951 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,960 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:08,963 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:09,574 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:10,098 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:13:10,107 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:13:10,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,129 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 [2022-11-21 17:13:10,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-21 17:13:10,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,183 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 [2022-11-21 17:13:10,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-21 17:13:10,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-21 17:13:10,227 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 [2022-11-21 17:13:10,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,267 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 [2022-11-21 17:13:10,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-21 17:13:10,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,328 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 [2022-11-21 17:13:10,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-21 17:13:10,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-21 17:13:10,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 [2022-11-21 17:13:10,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,447 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 [2022-11-21 17:13:10,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-21 17:13:10,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,491 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 [2022-11-21 17:13:10,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-21 17:13:10,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,539 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 [2022-11-21 17:13:10,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-21 17:13:10,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,551 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-21 17:13:10,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,552 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 17:13:10,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,579 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 [2022-11-21 17:13:10,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-21 17:13:10,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-21 17:13:10,607 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 [2022-11-21 17:13:10,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,629 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-21 17:13:10,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 [2022-11-21 17:13:10,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,654 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-21 17:13:10,657 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 [2022-11-21 17:13:10,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-21 17:13:10,711 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 [2022-11-21 17:13:10,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,750 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,762 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 [2022-11-21 17:13:10,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-21 17:13:10,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-21 17:13:10,811 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 [2022-11-21 17:13:10,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,844 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,852 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 [2022-11-21 17:13:10,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-21 17:13:10,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,884 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,892 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 [2022-11-21 17:13:10,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:10,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-21 17:13:10,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:10,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:10,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,924 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,942 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 [2022-11-21 17:13:10,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:10,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-21 17:13:10,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:10,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:10,977 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:10,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-21 17:13:10,982 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 [2022-11-21 17:13:10,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:10,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:10,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:10,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:10,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:10,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:11,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:11,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,017 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,020 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 [2022-11-21 17:13:11,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:11,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:11,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:11,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:11,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-21 17:13:11,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:11,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:11,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:11,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,059 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,067 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 [2022-11-21 17:13:11,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:11,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:11,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:11,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:11,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:11,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:11,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-21 17:13:11,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:11,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,123 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 [2022-11-21 17:13:11,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:11,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:11,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:11,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:11,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-21 17:13:11,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:11,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:11,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:11,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,167 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,171 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 [2022-11-21 17:13:11,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-21 17:13:11,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:11,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:11,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:11,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:11,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:11,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:11,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:11,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,216 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,223 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 [2022-11-21 17:13:11,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:11,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:11,236 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-21 17:13:11,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:11,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-21 17:13:11,251 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-21 17:13:11,251 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-21 17:13:11,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:13:11,347 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-11-21 17:13:11,347 INFO L444 ModelExtractionUtils]: 4 out of 21 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-11-21 17:13:11,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:11,406 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:11,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:13:11,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-21 17:13:11,463 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-11-21 17:13:11,463 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:13:11,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 Supporting invariants [] [2022-11-21 17:13:11,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,631 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-21 17:13:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:13:11,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:11,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 17:13:11,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:11,739 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-21 17:13:11,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:11,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:11,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 16 transitions. Complement of second has 7 states. [2022-11-21 17:13:11,790 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 [2022-11-21 17:13:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-11-21 17:13:11,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-21 17:13:11,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:11,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-21 17:13:11,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:11,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-21 17:13:11,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:11,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-11-21 17:13:11,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:11,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-11-21 17:13:11,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-21 17:13:11,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-21 17:13:11,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-11-21 17:13:11,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:11,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-21 17:13:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-11-21 17:13:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-21 17:13:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-11-21 17:13:11,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-21 17:13:11,798 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-21 17:13:11,799 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 17:13:11,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-11-21 17:13:11,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:11,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:11,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:11,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:13:11,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 17:13:11,800 INFO L748 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 205#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 194#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 195#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 204#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 198#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 199#L556-2 [2022-11-21 17:13:11,801 INFO L750 eck$LassoCheckResult]: Loop: 199#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 202#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 206#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 199#L556-2 [2022-11-21 17:13:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2022-11-21 17:13:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:11,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889274517] [2022-11-21 17:13:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2022-11-21 17:13:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:11,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627994453] [2022-11-21 17:13:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash 658080967, now seen corresponding path program 1 times [2022-11-21 17:13:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:11,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256320068] [2022-11-21 17:13:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:11,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:13,534 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:13:13,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:13:13,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:13:13,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:13:13,535 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:13:13,535 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:13,535 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:13:13,535 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:13:13,535 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration3_Lasso [2022-11-21 17:13:13,535 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:13:13,535 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:13:13,539 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,544 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,547 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,550 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,552 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,555 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,558 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,560 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,564 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,566 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,573 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:13,576 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,184 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,192 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,202 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:13:14,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:13:14,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:13:14,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,751 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-21 17:13:14,760 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 [2022-11-21 17:13:14,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:14,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:14,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:14,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,792 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,795 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 [2022-11-21 17:13:14,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-21 17:13:14,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:14,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:14,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,815 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-21 17:13:14,818 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 [2022-11-21 17:13:14,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:14,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:14,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:14,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,833 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-21 17:13:14,836 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 [2022-11-21 17:13:14,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:14,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:14,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:14,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,852 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-21 17:13:14,854 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 [2022-11-21 17:13:14,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:14,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:14,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-11-21 17:13:14,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,889 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,899 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 [2022-11-21 17:13:14,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:14,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,911 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-21 17:13:14,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,912 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 17:13:14,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:14,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-21 17:13:14,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,939 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,947 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 [2022-11-21 17:13:14,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:14,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:14,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:14,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-21 17:13:14,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:14,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:14,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:14,980 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:14,983 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 [2022-11-21 17:13:14,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:14,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:14,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:14,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:14,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:14,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-21 17:13:15,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,020 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,025 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 [2022-11-21 17:13:15,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:15,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:15,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:15,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-21 17:13:15,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,061 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,067 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 [2022-11-21 17:13:15,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:15,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:15,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:15,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-21 17:13:15,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,096 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,115 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 [2022-11-21 17:13:15,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-21 17:13:15,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:15,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:15,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:15,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,148 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,155 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 [2022-11-21 17:13:15,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-21 17:13:15,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:13:15,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:13:15,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:13:15,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,172 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,183 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 [2022-11-21 17:13:15,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-21 17:13:15,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:15,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,230 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,243 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 [2022-11-21 17:13:15,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-21 17:13:15,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:15,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,290 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,294 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 [2022-11-21 17:13:15,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:15,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-21 17:13:15,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,334 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,339 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 [2022-11-21 17:13:15,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-21 17:13:15,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:15,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,388 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,395 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 [2022-11-21 17:13:15,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:13:15,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-21 17:13:15,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:13:15,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:13:15,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:13:15,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,452 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,459 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 [2022-11-21 17:13:15,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:13:15,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:13:15,473 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-21 17:13:15,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:13:15,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-21 17:13:15,487 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-21 17:13:15,488 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-21 17:13:15,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:13:15,557 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-21 17:13:15,557 INFO L444 ModelExtractionUtils]: 7 out of 21 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-21 17:13:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:13:15,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:15,561 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:13:15,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:13:15,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-21 17:13:15,600 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-11-21 17:13:15,600 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:13:15,601 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 Supporting invariants [] [2022-11-21 17:13:15,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-21 17:13:15,710 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-21 17:13:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:15,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:13:15,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:15,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 17:13:15,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:15,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-21 17:13:15,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:15,821 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 24 transitions. Complement of second has 7 states. [2022-11-21 17:13:15,821 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 [2022-11-21 17:13:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-11-21 17:13:15,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-21 17:13:15,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:15,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-21 17:13:15,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:15,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2022-11-21 17:13:15,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:13:15,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2022-11-21 17:13:15,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:15,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2022-11-21 17:13:15,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-21 17:13:15,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-11-21 17:13:15,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-11-21 17:13:15,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:15,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-21 17:13:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-11-21 17:13:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-21 17:13:15,828 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) [2022-11-21 17:13:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-21 17:13:15,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-21 17:13:15,829 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-21 17:13:15,829 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 17:13:15,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-11-21 17:13:15,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-21 17:13:15,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:15,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:15,832 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2022-11-21 17:13:15,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 17:13:15,832 INFO L748 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 386#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 375#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 376#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 390#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 388#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 387#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 385#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 379#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 380#L556-2 [2022-11-21 17:13:15,832 INFO L750 eck$LassoCheckResult]: Loop: 380#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 383#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 389#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 380#L556-2 [2022-11-21 17:13:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash 658080969, now seen corresponding path program 2 times [2022-11-21 17:13:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:15,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728420650] [2022-11-21 17:13:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:16,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728420650] [2022-11-21 17:13:16,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728420650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:16,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180335255] [2022-11-21 17:13:16,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:13:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:16,320 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:16,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-21 17:13:16,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-11-21 17:13:16,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:13:16,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:13:16,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 17:13:16,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:16,530 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:13:16,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 17:13:16,568 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-21 17:13:16,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-21 17:13:16,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:13:16,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:13:16,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:13:16,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-21 17:13:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:16,987 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:13:16,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:13:17,006 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:13:17,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 74 [2022-11-21 17:13:17,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:17,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-21 17:13:17,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 17:13:17,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-21 17:13:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:17,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:17,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180335255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:13:17,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:13:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-21 17:13:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724241957] [2022-11-21 17:13:17,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:13:17,350 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2022-11-21 17:13:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:17,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117885201] [2022-11-21 17:13:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:17,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:17,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:17,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:13:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=163, Unknown=3, NotChecked=0, Total=210 [2022-11-21 17:13:17,479 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 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) [2022-11-21 17:13:17,511 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (not |c_ULTIMATE.start_main_#t~short9#1|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~maxId~0#1.base|) 1) (or .cse0 (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~maxId~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~maxId~0#1.offset|))) (or (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse1 (select .cse3 |ULTIMATE.start_main_~id~0#1.offset|))) (and (<= (+ .cse1 1) .cse2) (<= 0 .cse1)))) (and .cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_main_~id~0#1.base| Int) (|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base|))) (and (<= 0 (select .cse4 |ULTIMATE.start_main_~id~0#1.offset|)) (= .cse4 (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base|)) (= .cse2 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~maxId~0#1.offset|)))))) (exists ((v_DerPreprocessor_2 (Array Int Int))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~id~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (let ((.cse5 (select .cse6 |ULTIMATE.start_main_~id~0#1.offset|))) (and (<= 0 .cse5) (<= (+ .cse5 1) .cse2)))) (= .cse6 (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~id~0#1.base|))))) (= .cse2 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~maxId~0#1.offset|)))) (and .cse0 (exists ((|ULTIMATE.start_main_~id~0#1.offset| Int)) (<= 0 (select .cse3 |ULTIMATE.start_main_~id~0#1.offset|))))))))) is different from true [2022-11-21 17:13:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:13:17,708 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-21 17:13:17,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2022-11-21 17:13:17,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-21 17:13:17,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 30 transitions. [2022-11-21 17:13:17,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-21 17:13:17,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-21 17:13:17,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2022-11-21 17:13:17,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:17,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-21 17:13:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2022-11-21 17:13:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-11-21 17:13:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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) [2022-11-21 17:13:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-21 17:13:17,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-21 17:13:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:13:17,714 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-21 17:13:17,714 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 17:13:17,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2022-11-21 17:13:17,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-21 17:13:17,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:17,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:17,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2022-11-21 17:13:17,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2022-11-21 17:13:17,716 INFO L748 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 514#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 502#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 503#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 512#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 506#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 507#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 510#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 508#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 509#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 522#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 521#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 518#L556-2 [2022-11-21 17:13:17,716 INFO L750 eck$LassoCheckResult]: Loop: 518#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 519#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 515#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 516#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 520#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 517#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 518#L556-2 [2022-11-21 17:13:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1635602290, now seen corresponding path program 2 times [2022-11-21 17:13:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:17,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683088202] [2022-11-21 17:13:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683088202] [2022-11-21 17:13:18,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683088202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708814218] [2022-11-21 17:13:18,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:13:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:18,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:18,395 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:18,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-21 17:13:18,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:13:18,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:13:18,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-21 17:13:18,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:18,541 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-21 17:13:18,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-21 17:13:18,573 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-21 17:13:18,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-21 17:13:18,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:13:18,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:13:18,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 17:13:18,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:13:18,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:18,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:13:18,658 INFO L321 Elim1Store]: treesize reduction 4, result has 55.6 percent of original size [2022-11-21 17:13:18,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 17:13:18,786 INFO L321 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2022-11-21 17:13:18,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-21 17:13:18,828 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:13:18,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:13:18,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-21 17:13:19,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-11-21 17:13:19,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2022-11-21 17:13:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:19,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:19,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708814218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:13:19,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:13:19,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-11-21 17:13:19,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052753976] [2022-11-21 17:13:19,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:13:19,781 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1365695075, now seen corresponding path program 1 times [2022-11-21 17:13:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:19,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016905671] [2022-11-21 17:13:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:19,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:19,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 17:13:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-11-21 17:13:20,024 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 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) [2022-11-21 17:13:32,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 17:13:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:13:32,978 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-21 17:13:32,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2022-11-21 17:13:32,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:13:32,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 40 states and 44 transitions. [2022-11-21 17:13:32,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-11-21 17:13:32,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-11-21 17:13:32,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2022-11-21 17:13:32,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:32,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-21 17:13:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2022-11-21 17:13:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-21 17:13:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 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) [2022-11-21 17:13:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-21 17:13:32,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-21 17:13:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:13:32,985 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-21 17:13:32,985 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 17:13:32,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2022-11-21 17:13:32,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:13:32,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:32,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:32,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2022-11-21 17:13:32,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2022-11-21 17:13:32,987 INFO L748 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 705#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 693#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 694#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 712#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 710#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 701#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 702#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 711#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 703#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 704#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 699#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 700#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 708#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 697#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 698#L556-2 [2022-11-21 17:13:32,987 INFO L750 eck$LassoCheckResult]: Loop: 698#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 709#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 716#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 717#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 706#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 707#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 719#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 720#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 718#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 698#L556-2 [2022-11-21 17:13:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 176108201, now seen corresponding path program 3 times [2022-11-21 17:13:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:32,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987446031] [2022-11-21 17:13:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:33,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987446031] [2022-11-21 17:13:33,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987446031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061541142] [2022-11-21 17:13:33,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:13:33,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:33,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:33,986 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:33,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-21 17:13:34,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 17:13:34,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:13:34,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-21 17:13:34,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:34,173 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-21 17:13:34,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-21 17:13:34,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-21 17:13:34,207 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-11-21 17:13:34,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2022-11-21 17:13:34,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:13:34,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-21 17:13:34,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:34,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2022-11-21 17:13:34,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:13:34,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-21 17:13:34,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-21 17:13:34,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:34,391 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:13:34,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 17:13:34,541 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 17:13:34,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:13:34,553 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:13:34,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-11-21 17:13:34,695 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:13:34,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-21 17:13:34,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-21 17:13:34,810 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:13:34,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:13:34,999 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:13:34,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2022-11-21 17:13:35,112 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:13:35,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-21 17:13:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:13:35,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:36,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061541142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:13:36,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:13:36,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 29 [2022-11-21 17:13:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793299353] [2022-11-21 17:13:36,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:13:36,142 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 2 times [2022-11-21 17:13:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:36,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494525097] [2022-11-21 17:13:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:36,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:36,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 17:13:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=756, Unknown=10, NotChecked=0, Total=870 [2022-11-21 17:13:36,770 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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) [2022-11-21 17:13:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:13:37,676 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-21 17:13:37,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2022-11-21 17:13:37,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:13:37,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 39 transitions. [2022-11-21 17:13:37,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-11-21 17:13:37,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-11-21 17:13:37,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2022-11-21 17:13:37,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:37,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-21 17:13:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2022-11-21 17:13:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-11-21 17:13:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 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) [2022-11-21 17:13:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-21 17:13:37,682 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-21 17:13:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 17:13:37,691 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-21 17:13:37,691 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 17:13:37,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2022-11-21 17:13:37,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:13:37,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:37,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:37,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2022-11-21 17:13:37,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2022-11-21 17:13:37,693 INFO L748 eck$LassoCheckResult]: Stem: 908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 918#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 906#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 907#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 921#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 912#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 913#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 924#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 922#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 923#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 926#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 925#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 916#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 917#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 933#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 932#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 930#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 910#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 911#L556-2 [2022-11-21 17:13:37,693 INFO L750 eck$LassoCheckResult]: Loop: 911#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 919#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 920#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 914#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 915#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 931#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 928#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 929#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 927#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 911#L556-2 [2022-11-21 17:13:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 4 times [2022-11-21 17:13:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:37,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944358983] [2022-11-21 17:13:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944358983] [2022-11-21 17:13:38,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944358983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668052839] [2022-11-21 17:13:38,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 17:13:38,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:38,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:38,702 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:38,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-21 17:13:38,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 17:13:38,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:13:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 17:13:38,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:38,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-21 17:13:38,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:13:38,852 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:13:38,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 17:13:38,960 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:13:38,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-11-21 17:13:38,991 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:13:38,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:13:39,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2022-11-21 17:13:39,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-11-21 17:13:39,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-21 17:13:39,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-11-21 17:13:39,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-11-21 17:13:39,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 23 [2022-11-21 17:13:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:39,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:40,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:40,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2022-11-21 17:13:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:41,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668052839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:13:41,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:13:41,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-11-21 17:13:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141983807] [2022-11-21 17:13:41,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:13:41,475 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 3 times [2022-11-21 17:13:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:41,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171262157] [2022-11-21 17:13:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:41,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:41,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:42,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 17:13:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1025, Unknown=16, NotChecked=0, Total=1190 [2022-11-21 17:13:42,112 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:13:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:13:43,182 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-21 17:13:43,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2022-11-21 17:13:43,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-21 17:13:43,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 41 transitions. [2022-11-21 17:13:43,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-11-21 17:13:43,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-11-21 17:13:43,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 41 transitions. [2022-11-21 17:13:43,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:13:43,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-21 17:13:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 41 transitions. [2022-11-21 17:13:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-11-21 17:13:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 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) [2022-11-21 17:13:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-21 17:13:43,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-21 17:13:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:13:43,188 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-21 17:13:43,189 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 17:13:43,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2022-11-21 17:13:43,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-21 17:13:43,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:13:43,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:13:43,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 2, 1, 1, 1, 1] [2022-11-21 17:13:43,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2022-11-21 17:13:43,191 INFO L748 eck$LassoCheckResult]: Stem: 1146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1155#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1144#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1145#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1175#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1176#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1174#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1172#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1148#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1149#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1152#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1177#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1153#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1154#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1150#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1151#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1158#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1159#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1173#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1165#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1166#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1164#L556-2 [2022-11-21 17:13:43,191 INFO L750 eck$LassoCheckResult]: Loop: 1164#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1171#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1160#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1161#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1156#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1157#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1170#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1169#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1168#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1163#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1167#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1162#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1164#L556-2 [2022-11-21 17:13:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1620751923, now seen corresponding path program 5 times [2022-11-21 17:13:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:43,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844454212] [2022-11-21 17:13:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:43,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844454212] [2022-11-21 17:13:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844454212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773383718] [2022-11-21 17:13:44,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 17:13:44,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:44,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:44,724 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:44,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-21 17:13:44,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-21 17:13:44,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:13:44,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-21 17:13:44,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:44,893 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-21 17:13:44,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-21 17:13:44,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:13:44,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:13:44,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-21 17:13:44,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:13:44,961 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:13:44,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 17:13:45,136 INFO L321 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2022-11-21 17:13:45,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 83 [2022-11-21 17:13:45,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 17:13:45,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:13:45,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-21 17:13:45,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:13:45,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:13:45,426 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-21 17:13:45,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 62 [2022-11-21 17:13:45,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-21 17:13:45,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-11-21 17:13:45,643 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-21 17:13:45,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-21 17:13:45,963 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-21 17:13:45,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2022-11-21 17:13:46,249 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-21 17:13:46,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 50 [2022-11-21 17:13:46,578 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-21 17:13:46,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 53 [2022-11-21 17:13:46,788 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-21 17:13:46,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 38 [2022-11-21 17:13:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:46,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:48,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:48,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 139 [2022-11-21 17:13:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:13:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773383718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:13:50,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:13:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2022-11-21 17:13:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853011258] [2022-11-21 17:13:50,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:13:50,121 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:13:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:13:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 4 times [2022-11-21 17:13:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:13:50,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981443795] [2022-11-21 17:13:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:13:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:50,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:13:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:13:50,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:13:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:13:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 17:13:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2007, Unknown=45, NotChecked=0, Total=2352 [2022-11-21 17:13:51,228 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 49 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) [2022-11-21 17:13:51,417 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~id~0#1.base| |c_ULTIMATE.start_main_~maxId~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~id~0#1.base|) 1) (= |c_ULTIMATE.start_main_~id~0#1.offset| 0) (or .cse0 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= .cse1 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~id~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~maxId~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~id~0#1.base|)) (= (select v_DerPreprocessor_8 |c_ULTIMATE.start_main_~maxId~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~maxId~0#1.base|) 1) (not .cse0) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~id~0#1.offset|)))) is different from true [2022-11-21 17:13:52,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:13:55,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:15:09,026 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 170 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:15:18,603 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 84 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:15:56,109 WARN L233 SmtUtils]: Spent 36.38s on a formula simplification. DAG size of input: 89 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:16:37,936 WARN L233 SmtUtils]: Spent 39.26s on a formula simplification. DAG size of input: 147 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:16:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:43,178 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-11-21 17:16:43,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 108 transitions. [2022-11-21 17:16:43,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:16:43,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 88 states and 92 transitions. [2022-11-21 17:16:43,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-21 17:16:43,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-21 17:16:43,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 92 transitions. [2022-11-21 17:16:43,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:16:43,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-21 17:16:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 92 transitions. [2022-11-21 17:16:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2022-11-21 17:16:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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) [2022-11-21 17:16:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-11-21 17:16:43,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-11-21 17:16:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-21 17:16:43,190 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-11-21 17:16:43,190 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-21 17:16:43,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 61 transitions. [2022-11-21 17:16:43,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:16:43,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:16:43,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:16:43,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 8, 2, 1, 1, 1, 1] [2022-11-21 17:16:43,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-21 17:16:43,192 INFO L748 eck$LassoCheckResult]: Stem: 1544#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1554#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1542#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1543#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1563#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1565#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1562#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1561#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1560#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1550#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1551#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1578#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1552#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1553#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1548#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1549#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1577#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1576#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1575#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1574#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1573#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1572#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1571#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1570#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1569#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1568#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1567#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1566#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1559#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1564#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1558#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1555#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1546#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1547#L556-2 [2022-11-21 17:16:43,193 INFO L750 eck$LassoCheckResult]: Loop: 1547#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1599#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1579#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1556#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1557#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1582#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1598#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1597#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1596#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1595#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1594#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1593#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1592#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1591#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1590#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1589#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1588#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1587#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1586#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1585#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1584#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1581#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1583#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1580#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1547#L556-2 [2022-11-21 17:16:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1556392051, now seen corresponding path program 6 times [2022-11-21 17:16:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:43,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945958954] [2022-11-21 17:16:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 1 proven. 116 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:16:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945958954] [2022-11-21 17:16:45,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945958954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275276373] [2022-11-21 17:16:45,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 17:16:45,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:45,094 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:45,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-21 17:16:45,390 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-11-21 17:16:45,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:16:45,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-21 17:16:45,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:45,453 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-21 17:16:45,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-21 17:16:45,494 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-21 17:16:45,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-21 17:16:45,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:16:45,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:16:45,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-21 17:16:45,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:16:45,549 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:16:45,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2022-11-21 17:16:45,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-11-21 17:16:45,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:16:45,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 17:16:45,819 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 17:16:45,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:16:45,833 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:45,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:16:46,027 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-11-21 17:16:46,228 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-21 17:16:46,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-21 17:16:46,362 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:16:46,425 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:16:46,492 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:16:46,572 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:16:46,647 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:16:46,877 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:46,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-21 17:16:47,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:16:47,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 48 [2022-11-21 17:16:47,320 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:16:47,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-21 17:16:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 17:16:47,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:16:50,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275276373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:16:50,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:16:50,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 41 [2022-11-21 17:16:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316380669] [2022-11-21 17:16:50,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:50,086 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:16:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 5 times [2022-11-21 17:16:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:50,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873179052] [2022-11-21 17:16:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:16:50,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:16:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:16:50,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:16:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 17:16:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1534, Unknown=21, NotChecked=0, Total=1722 [2022-11-21 17:16:59,245 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. cyclomatic complexity: 6 Second operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 42 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) [2022-11-21 17:17:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:01,449 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-11-21 17:17:01,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 99 transitions. [2022-11-21 17:17:01,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:17:01,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 68 states and 72 transitions. [2022-11-21 17:17:01,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-11-21 17:17:01,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-21 17:17:01,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 72 transitions. [2022-11-21 17:17:01,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:17:01,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-21 17:17:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 72 transitions. [2022-11-21 17:17:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2022-11-21 17:17:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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) [2022-11-21 17:17:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-11-21 17:17:01,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-21 17:17:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:17:01,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-21 17:17:01,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-21 17:17:01,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 64 transitions. [2022-11-21 17:17:01,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:17:01,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:17:01,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:17:01,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 9, 2, 1, 1, 1, 1] [2022-11-21 17:17:01,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-21 17:17:01,466 INFO L748 eck$LassoCheckResult]: Stem: 1965#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1974#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1963#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1964#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1971#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2023#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1972#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1973#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1969#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1970#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1975#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1967#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1968#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2022#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2021#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2020#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2019#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2018#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2017#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2016#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2015#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2014#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2013#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2012#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2011#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2010#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2009#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2008#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2007#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2006#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2005#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2003#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2004#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2002#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2001#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2000#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1980#L556-2 [2022-11-21 17:17:01,466 INFO L750 eck$LassoCheckResult]: Loop: 1980#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1998#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1976#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1977#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1999#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1997#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1996#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1995#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1994#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1993#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1992#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1991#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1990#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1989#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1988#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1987#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1986#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1985#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1984#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1983#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1982#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1979#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1981#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1978#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1980#L556-2 [2022-11-21 17:17:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1653652850, now seen corresponding path program 7 times [2022-11-21 17:17:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:01,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785857182] [2022-11-21 17:17:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 7 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:04,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785857182] [2022-11-21 17:17:04,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785857182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:04,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931942477] [2022-11-21 17:17:04,627 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 17:17:04,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:04,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:04,630 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:04,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-21 17:17:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 17:17:04,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:04,855 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-21 17:17:04,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-21 17:17:04,887 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-21 17:17:04,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-21 17:17:04,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:17:04,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-21 17:17:04,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:17:04,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 17:17:04,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:17:04,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-21 17:17:04,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:17:04,983 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:04,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-21 17:17:05,143 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 17:17:05,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:17:05,155 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:17:05,286 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-21 17:17:05,498 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2022-11-21 17:17:05,744 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-21 17:17:05,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-21 17:17:05,875 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:17:05,945 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:05,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:17:06,012 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:06,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:17:06,075 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:06,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:17:06,317 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:06,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-21 17:17:06,487 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:06,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2022-11-21 17:17:06,835 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:06,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 48 [2022-11-21 17:17:07,028 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:17:07,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-21 17:17:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:17:07,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:17:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931942477] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:17:10,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:17:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 17] total 51 [2022-11-21 17:17:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289482114] [2022-11-21 17:17:10,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:10,763 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:17:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 6 times [2022-11-21 17:17:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:10,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971334070] [2022-11-21 17:17:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:17:10,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:17:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:17:10,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:17:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 17:17:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2423, Unknown=39, NotChecked=0, Total=2652 [2022-11-21 17:17:19,108 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. cyclomatic complexity: 6 Second operand has 52 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 states have internal predecessors, (90), 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) [2022-11-21 17:17:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:23,693 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-21 17:17:23,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 105 transitions. [2022-11-21 17:17:23,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:17:23,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 74 states and 78 transitions. [2022-11-21 17:17:23,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-21 17:17:23,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-21 17:17:23,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 78 transitions. [2022-11-21 17:17:23,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:17:23,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-21 17:17:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 78 transitions. [2022-11-21 17:17:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2022-11-21 17:17:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 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) [2022-11-21 17:17:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-21 17:17:23,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-21 17:17:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 17:17:23,707 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-21 17:17:23,707 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-21 17:17:23,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 67 transitions. [2022-11-21 17:17:23,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:17:23,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:17:23,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:17:23,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 10, 2, 1, 1, 1, 1] [2022-11-21 17:17:23,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2022-11-21 17:17:23,712 INFO L748 eck$LassoCheckResult]: Stem: 2437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 2445#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 2435#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 2436#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2443#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2475#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2476#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2477#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2441#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2442#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2444#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2447#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2455#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2454#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2452#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2453#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2474#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2473#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2472#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2471#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2470#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2469#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2468#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2467#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2466#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2465#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2464#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2463#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2462#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2461#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2460#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2459#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2458#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2457#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2451#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2456#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2450#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2446#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2439#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2440#L556-2 [2022-11-21 17:17:23,713 INFO L750 eck$LassoCheckResult]: Loop: 2440#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2498#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2478#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2448#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2449#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2481#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2497#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2496#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2495#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2494#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2493#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2492#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2491#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2490#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2489#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2488#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2487#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2486#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2485#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2484#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2483#L556 assume main_#t~mem15#1 < main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 2480#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 2482#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 2479#L556 assume !(main_#t~mem15#1 < main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 2440#L556-2 [2022-11-21 17:17:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash -47191059, now seen corresponding path program 8 times [2022-11-21 17:17:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106536991] [2022-11-21 17:17:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 10 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106536991] [2022-11-21 17:17:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106536991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822308168] [2022-11-21 17:17:26,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:17:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:26,530 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:26,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-21 17:17:26,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:17:26,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:17:26,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-21 17:17:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:26,726 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:17:26,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 17:17:26,861 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 17:17:26,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:17:26,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-21 17:17:26,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-21 17:17:27,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-21 17:17:27,264 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:27,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-21 17:17:27,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-11-21 17:17:27,369 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:27,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-11-21 17:17:27,641 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:27,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-11-21 17:17:27,955 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:27,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:28,278 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:28,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:28,617 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:28,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:28,928 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:28,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:29,255 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:29,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:29,567 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:17:29,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2022-11-21 17:17:29,833 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-21 17:17:29,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 34 [2022-11-21 17:17:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 31 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:29,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:45,596 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-21 17:17:45,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 101 [2022-11-21 17:17:45,597 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-21 17:17:45,597 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:836) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:751) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 45 more [2022-11-21 17:17:45,600 INFO L158 Benchmark]: Toolchain (without parser) took 280092.31ms. Allocated memory was 127.9MB in the beginning and 297.8MB in the end (delta: 169.9MB). Free memory was 94.4MB in the beginning and 169.4MB in the end (delta: -75.0MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,600 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:17:45,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.37ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 79.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.59ms. Allocated memory is still 127.9MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,601 INFO L158 Benchmark]: Boogie Preprocessor took 25.28ms. Allocated memory is still 127.9MB. Free memory was 77.1MB in the beginning and 75.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,601 INFO L158 Benchmark]: RCFGBuilder took 316.98ms. Allocated memory is still 127.9MB. Free memory was 75.5MB in the beginning and 63.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,602 INFO L158 Benchmark]: BuchiAutomizer took 279269.38ms. Allocated memory was 127.9MB in the beginning and 297.8MB in the end (delta: 169.9MB). Free memory was 63.5MB in the beginning and 169.4MB in the end (delta: -105.8MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2022-11-21 17:17:45,603 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.33ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.37ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 79.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.59ms. Allocated memory is still 127.9MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.28ms. Allocated memory is still 127.9MB. Free memory was 77.1MB in the beginning and 75.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.98ms. Allocated memory is still 127.9MB. Free memory was 75.5MB in the beginning and 63.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 279269.38ms. Allocated memory was 127.9MB in the beginning and 297.8MB in the end (delta: 169.9MB). Free memory was 63.5MB in the beginning and 169.4MB in the end (delta: -105.8MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-21 17:17:45,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-11-21 17:17:45,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-11-21 17:17:46,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-11-21 17:17:46,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-11-21 17:17:46,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-11-21 17:17:46,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-11-21 17:17:46,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-11-21 17:17:47,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd64ab-fab8-4739-8fda-965d9612a959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")