./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- 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-dbf71c6-m [2022-10-17 10:16:33,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:16:33,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:16:33,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:16:33,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:16:33,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:16:33,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:16:33,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:16:33,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:16:33,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:16:33,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:16:33,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:16:33,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:16:33,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:16:33,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:16:33,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:16:33,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:16:33,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:16:33,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:16:33,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:16:33,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:16:33,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:16:33,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:16:33,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:16:33,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:16:33,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:16:33,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:16:33,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:16:33,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:16:33,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:16:33,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:16:33,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:16:33,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:16:33,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:16:33,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:16:33,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:16:33,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:16:33,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:16:33,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:16:33,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:16:33,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:16:33,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-10-17 10:16:33,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:16:33,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:16:33,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:16:33,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:16:33,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:16:33,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:16:33,298 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:16:33,299 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-10-17 10:16:33,299 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-10-17 10:16:33,299 INFO L138 SettingsManager]: * Use old map elimination=false [2022-10-17 10:16:33,299 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-10-17 10:16:33,299 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-10-17 10:16:33,300 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-10-17 10:16:33,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:16:33,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:16:33,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:16:33,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:16:33,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:16:33,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:16:33,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-10-17 10:16:33,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-10-17 10:16:33,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-10-17 10:16:33,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:16:33,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:16:33,302 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-10-17 10:16:33,303 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:16:33,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-10-17 10:16:33,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:16:33,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:16:33,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:16:33,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:16:33,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-10-17 10:16:33,305 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_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/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_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2022-10-17 10:16:33,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:16:33,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:16:33,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:16:33,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:16:33,621 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:16:33,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-10-17 10:16:33,712 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/data/05daf1226/e05589807da245a1951b8beb1477f47d/FLAG012b4e5f3 [2022-10-17 10:16:34,212 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:16:34,214 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-10-17 10:16:34,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/data/05daf1226/e05589807da245a1951b8beb1477f47d/FLAG012b4e5f3 [2022-10-17 10:16:34,572 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/data/05daf1226/e05589807da245a1951b8beb1477f47d [2022-10-17 10:16:34,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:16:34,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:16:34,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:16:34,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:16:34,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:16:34,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68028ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34, skipping insertion in model container [2022-10-17 10:16:34,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:16:34,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:16:34,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-10-17 10:16:34,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:16:34,854 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:16:34,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-10-17 10:16:34,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:16:34,903 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:16:34,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34 WrapperNode [2022-10-17 10:16:34,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:16:34,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:16:34,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:16:34,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:16:34,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,946 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-10-17 10:16:34,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:16:34,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:16:34,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:16:34,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:16:34,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:34,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:16:35,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:16:35,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:16:35,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:16:35,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (1/1) ... [2022-10-17 10:16:35,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:35,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:35,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-10-17 10:16:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:16:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:16:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:16:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:16:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:16:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:16:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:16:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:16:35,189 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:16:35,191 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:16:35,367 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:16:35,374 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:16:35,374 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-17 10:16:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:16:35 BoogieIcfgContainer [2022-10-17 10:16:35,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:16:35,377 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-10-17 10:16:35,377 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-10-17 10:16:35,382 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-10-17 10:16:35,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:16:35,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.10 10:16:34" (1/3) ... [2022-10-17 10:16:35,384 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a67abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:16:35, skipping insertion in model container [2022-10-17 10:16:35,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:16:35,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:16:34" (2/3) ... [2022-10-17 10:16:35,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a67abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:16:35, skipping insertion in model container [2022-10-17 10:16:35,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:16:35,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:16:35" (3/3) ... [2022-10-17 10:16:35,386 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-10-17 10:16:35,442 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-10-17 10:16:35,442 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-10-17 10:16:35,442 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-10-17 10:16:35,443 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-10-17 10:16:35,443 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-10-17 10:16:35,443 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-10-17 10:16:35,443 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-10-17 10:16:35,443 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-10-17 10:16:35,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:35,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-10-17 10:16:35,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:35,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:35,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:16:35,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:35,497 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-10-17 10:16:35,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:35,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-10-17 10:16:35,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:35,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:35,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-10-17 10:16:35,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:35,512 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2022-10-17 10:16:35,526 INFO L750 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 15#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2022-10-17 10:16:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-10-17 10:16:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:35,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674680866] [2022-10-17 10:16:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-10-17 10:16:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:35,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26150517] [2022-10-17 10:16:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-10-17 10:16:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:35,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062117432] [2022-10-17 10:16:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:35,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:36,439 INFO L210 LassoAnalysis]: Preferences: [2022-10-17 10:16:36,439 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-10-17 10:16:36,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-10-17 10:16:36,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-10-17 10:16:36,440 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-10-17 10:16:36,440 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:36,440 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-10-17 10:16:36,440 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-10-17 10:16:36,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-10-17 10:16:36,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-10-17 10:16:36,441 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-10-17 10:16:36,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:36,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:16:37,227 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-10-17 10:16:37,232 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-10-17 10:16:37,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,242 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-10-17 10:16:37,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-10-17 10:16:37,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-10-17 10:16:37,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-10-17 10:16:37,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-10-17 10:16:37,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,323 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-10-17 10:16:37,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:37,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:37,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-10-17 10:16:37,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,392 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-10-17 10:16:37,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-10-17 10:16:37,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:37,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:37,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,471 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-10-17 10:16:37,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-10-17 10:16:37,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-10-17 10:16:37,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-10-17 10:16:37,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-10-17 10:16:37,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,550 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-10-17 10:16:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-10-17 10:16:37,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-10-17 10:16:37,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-10-17 10:16:37,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-10-17 10:16:37,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,631 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-10-17 10:16:37,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-10-17 10:16:37,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:37,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:37,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,714 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-10-17 10:16:37,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-10-17 10:16:37,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-10-17 10:16:37,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-10-17 10:16:37,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-10-17 10:16:37,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,784 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-10-17 10:16:37,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-10-17 10:16:37,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-10-17 10:16:37,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-10-17 10:16:37,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-10-17 10:16:37,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,846 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,851 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-10-17 10:16:37,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-10-17 10:16:37,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:37,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:37,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,918 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:37,930 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-10-17 10:16:37,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:37,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:37,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:37,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:37,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:37,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:37,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-10-17 10:16:37,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-10-17 10:16:37,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:37,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:37,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:37,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:38,006 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-10-17 10:16:38,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-10-17 10:16:38,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-10-17 10:16:38,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-10-17 10:16:38,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-10-17 10:16:38,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-10-17 10:16:38,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-10-17 10:16:38,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-10-17 10:16:38,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-10-17 10:16:38,141 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-10-17 10:16:38,141 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-10-17 10:16:38,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:16:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:38,170 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:16:38,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-10-17 10:16:38,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-10-17 10:16:38,276 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-10-17 10:16:38,276 INFO L513 LassoAnalysis]: Proved termination. [2022-10-17 10:16:38,279 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-10-17 10:16:38,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:38,370 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-10-17 10:16:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-17 10:16:38,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:38,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-17 10:16:38,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:38,556 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-10-17 10:16:38,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:38,616 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 45 transitions. Complement of second has 8 states. [2022-10-17 10:16:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-10-17 10:16:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-10-17 10:16:38,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-10-17 10:16:38,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-10-17 10:16:38,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-10-17 10:16:38,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-10-17 10:16:38,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-10-17 10:16:38,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-10-17 10:16:38,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2022-10-17 10:16:38,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-10-17 10:16:38,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 13 states and 18 transitions. [2022-10-17 10:16:38,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-10-17 10:16:38,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-10-17 10:16:38,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-10-17 10:16:38,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:38,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-10-17 10:16:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-10-17 10:16:38,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-10-17 10:16:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-10-17 10:16:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-10-17 10:16:38,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-10-17 10:16:38,728 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-10-17 10:16:38,728 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-10-17 10:16:38,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-10-17 10:16:38,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-10-17 10:16:38,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:38,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:38,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-10-17 10:16:38,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:38,732 INFO L748 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 140#L20-3 assume !(main_~i~0#1 < 100000); 141#L20-4 main_~i~0#1 := 0; 139#L26-3 [2022-10-17 10:16:38,733 INFO L750 eck$LassoCheckResult]: Loop: 139#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 145#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 138#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 139#L26-3 [2022-10-17 10:16:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-10-17 10:16:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:38,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841524451] [2022-10-17 10:16:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841524451] [2022-10-17 10:16:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841524451] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:16:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:16:38,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:16:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439461626] [2022-10-17 10:16:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:16:38,834 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:16:38,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-10-17 10:16:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:38,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599536821] [2022-10-17 10:16:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:38,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:38,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:16:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:16:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:16:38,893 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:16:38,930 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-10-17 10:16:38,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-10-17 10:16:38,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:38,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 24 transitions. [2022-10-17 10:16:38,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-10-17 10:16:38,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-10-17 10:16:38,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-10-17 10:16:38,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:38,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-10-17 10:16:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-10-17 10:16:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2022-10-17 10:16:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-10-17 10:16:38,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-10-17 10:16:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:16:38,947 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-10-17 10:16:38,947 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-10-17 10:16:38,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-10-17 10:16:38,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:38,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:38,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:38,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:16:38,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:38,949 INFO L748 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 181#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 182#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 179#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 180#L20-3 assume !(main_~i~0#1 < 100000); 183#L20-4 main_~i~0#1 := 0; 178#L26-3 [2022-10-17 10:16:38,949 INFO L750 eck$LassoCheckResult]: Loop: 178#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 184#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 177#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 178#L26-3 [2022-10-17 10:16:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-10-17 10:16:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:38,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76239599] [2022-10-17 10:16:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76239599] [2022-10-17 10:16:39,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76239599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:16:39,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430691348] [2022-10-17 10:16:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:16:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:39,107 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:16:39,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-17 10:16:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:39,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-17 10:16:39,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:16:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430691348] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:16:39,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:16:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-17 10:16:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315961097] [2022-10-17 10:16:39,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:16:39,208 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:16:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-10-17 10:16:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:39,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943846106] [2022-10-17 10:16:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:39,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:39,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:16:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:16:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:16:39,282 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-10-17 10:16:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:16:39,397 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-10-17 10:16:39,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-10-17 10:16:39,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:39,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2022-10-17 10:16:39,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-10-17 10:16:39,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-10-17 10:16:39,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-10-17 10:16:39,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:39,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-10-17 10:16:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-10-17 10:16:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-10-17 10:16:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-10-17 10:16:39,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-10-17 10:16:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:16:39,422 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-10-17 10:16:39,422 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-10-17 10:16:39,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-10-17 10:16:39,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:39,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:39,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:39,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-10-17 10:16:39,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:39,427 INFO L748 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 274#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 275#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 281#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 276#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 279#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 288#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 287#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 286#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 284#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 285#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 283#L20-3 assume !(main_~i~0#1 < 100000); 282#L20-4 main_~i~0#1 := 0; 273#L26-3 [2022-10-17 10:16:39,427 INFO L750 eck$LassoCheckResult]: Loop: 273#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 280#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 272#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 273#L26-3 [2022-10-17 10:16:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-10-17 10:16:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:39,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476217015] [2022-10-17 10:16:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476217015] [2022-10-17 10:16:39,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476217015] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:16:39,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798986659] [2022-10-17 10:16:39,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 10:16:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:16:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:39,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:16:39,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-17 10:16:39,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 10:16:39,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:16:39,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-17 10:16:39,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:16:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:39,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798986659] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:16:39,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:16:39,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-10-17 10:16:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682412156] [2022-10-17 10:16:39,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:16:39,790 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:16:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-10-17 10:16:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:39,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662179532] [2022-10-17 10:16:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:39,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:39,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:16:39,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:16:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:16:39,841 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-10-17 10:16:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:16:40,028 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-10-17 10:16:40,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2022-10-17 10:16:40,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:40,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2022-10-17 10:16:40,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-10-17 10:16:40,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-10-17 10:16:40,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2022-10-17 10:16:40,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:40,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-10-17 10:16:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2022-10-17 10:16:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2022-10-17 10:16:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:16:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-10-17 10:16:40,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-10-17 10:16:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:16:40,041 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-10-17 10:16:40,041 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-10-17 10:16:40,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-10-17 10:16:40,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:40,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:40,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:40,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-10-17 10:16:40,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:40,044 INFO L748 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 486#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 487#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 518#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 488#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 489#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 490#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 491#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 516#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 515#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 514#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 513#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 512#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 510#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 509#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 508#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 507#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 506#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 505#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 504#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 503#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 502#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 501#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 500#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 499#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 498#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 497#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 495#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 494#L20-3 assume !(main_~i~0#1 < 100000); 493#L20-4 main_~i~0#1 := 0; 485#L26-3 [2022-10-17 10:16:40,045 INFO L750 eck$LassoCheckResult]: Loop: 485#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 492#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 484#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 485#L26-3 [2022-10-17 10:16:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-10-17 10:16:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:40,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20528370] [2022-10-17 10:16:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20528370] [2022-10-17 10:16:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20528370] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:16:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797475503] [2022-10-17 10:16:40,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-17 10:16:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:16:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:40,339 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:16:40,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-17 10:16:40,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-10-17 10:16:40,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:16:40,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-17 10:16:40,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:40,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:16:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:40,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797475503] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:16:40,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:16:40,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-10-17 10:16:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354370307] [2022-10-17 10:16:40,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:16:40,890 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:16:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-10-17 10:16:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:40,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984885413] [2022-10-17 10:16:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:40,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:40,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:16:40,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-17 10:16:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-10-17 10:16:40,944 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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-10-17 10:16:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:16:41,308 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-10-17 10:16:41,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2022-10-17 10:16:41,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:41,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2022-10-17 10:16:41,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-10-17 10:16:41,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-10-17 10:16:41,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2022-10-17 10:16:41,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:41,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2022-10-17 10:16:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2022-10-17 10:16:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2022-10-17 10:16:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 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-10-17 10:16:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2022-10-17 10:16:41,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-10-17 10:16:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-17 10:16:41,326 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-10-17 10:16:41,326 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-10-17 10:16:41,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2022-10-17 10:16:41,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:41,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:41,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:41,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-10-17 10:16:41,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:41,331 INFO L748 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 929#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 932#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1000#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 934#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 937#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 999#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 998#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 997#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 995#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 994#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 993#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 992#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 991#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 990#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 989#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 988#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 986#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 985#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 983#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 982#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 979#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 977#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 976#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 975#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 973#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 972#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 971#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 970#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 968#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 967#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 964#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 963#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 962#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 961#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 959#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 958#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 956#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 955#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 952#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 949#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 946#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 944#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 943#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 940#L20-3 assume !(main_~i~0#1 < 100000); 939#L20-4 main_~i~0#1 := 0; 931#L26-3 [2022-10-17 10:16:41,331 INFO L750 eck$LassoCheckResult]: Loop: 931#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 938#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 930#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 931#L26-3 [2022-10-17 10:16:41,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-10-17 10:16:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:41,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260890562] [2022-10-17 10:16:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:42,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260890562] [2022-10-17 10:16:42,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260890562] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:16:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352521322] [2022-10-17 10:16:42,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-17 10:16:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:16:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:42,168 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:16:42,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-17 10:16:42,291 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-17 10:16:42,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:16:42,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-17 10:16:42,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:16:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:42,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:16:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:43,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352521322] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:16:43,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:16:43,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-10-17 10:16:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221172990] [2022-10-17 10:16:43,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:16:43,332 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:16:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-10-17 10:16:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:43,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554599745] [2022-10-17 10:16:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:43,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:16:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:16:43,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:16:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:16:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-17 10:16:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-10-17 10:16:43,400 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 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-10-17 10:16:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:16:44,164 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-10-17 10:16:44,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2022-10-17 10:16:44,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:44,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2022-10-17 10:16:44,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2022-10-17 10:16:44,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-10-17 10:16:44,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2022-10-17 10:16:44,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:16:44,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2022-10-17 10:16:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2022-10-17 10:16:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2022-10-17 10:16:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 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-10-17 10:16:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2022-10-17 10:16:44,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-10-17 10:16:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-17 10:16:44,194 INFO L428 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-10-17 10:16:44,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-10-17 10:16:44,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2022-10-17 10:16:44,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-10-17 10:16:44,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:16:44,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:16:44,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-10-17 10:16:44,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-10-17 10:16:44,200 INFO L748 eck$LassoCheckResult]: Stem: 1842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1848#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1846#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1847#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1986#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1985#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1983#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1982#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1977#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1974#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1971#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1965#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1962#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1959#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1950#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1947#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1944#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1941#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1938#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1935#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1934#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1933#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1932#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1931#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1930#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1929#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1928#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1926#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1923#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1922#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1921#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1920#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1919#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1918#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1917#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1915#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1914#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1913#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1912#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1911#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1909#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1908#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1905#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1904#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1903#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1902#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1901#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1899#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1897#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1896#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1895#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1894#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1893#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1892#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1891#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1890#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1887#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1886#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1885#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1884#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1882#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1881#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1879#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1878#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1877#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1876#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1872#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1869#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1868#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1866#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1864#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1863#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1860#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1859#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1857#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1854#L20-3 assume !(main_~i~0#1 < 100000); 1853#L20-4 main_~i~0#1 := 0; 1845#L26-3 [2022-10-17 10:16:44,200 INFO L750 eck$LassoCheckResult]: Loop: 1845#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1851#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1844#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1845#L26-3 [2022-10-17 10:16:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:16:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-10-17 10:16:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:16:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881542673] [2022-10-17 10:16:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:16:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:16:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:16:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:16:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:16:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881542673] [2022-10-17 10:16:47,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881542673] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:16:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230122898] [2022-10-17 10:16:47,082 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-17 10:16:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:16:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:16:47,090 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:16:47,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e49d8df-30da-4748-83ec-ce7494bbf8c7/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process