./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8 --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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- 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-2329fc7 [2022-12-13 20:34:45,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:34:45,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:34:45,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:34:45,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:34:45,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:34:45,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:34:45,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:34:45,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:34:45,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:34:45,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:34:45,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:34:45,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:34:45,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:34:45,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:34:45,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:34:45,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:34:45,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:34:45,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:34:45,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:34:45,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:34:45,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:34:45,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:34:45,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:34:45,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:34:45,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:34:45,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:34:45,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:34:45,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:34:45,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:34:45,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:34:45,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:34:45,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:34:45,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:34:45,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:34:45,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:34:45,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:34:45,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:34:45,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:34:45,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:34:45,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:34:45,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 20:34:45,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:34:45,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:34:45,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:34:45,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:34:45,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:34:45,223 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 20:34:45,223 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 20:34:45,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 20:34:45,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 20:34:45,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:34:45,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:34:45,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:34:45,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:34:45,226 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 20:34:45,226 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_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/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_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8 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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2022-12-13 20:34:45,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:34:45,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:34:45,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:34:45,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:34:45,418 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:34:45,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-12-13 20:34:47,938 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:34:48,101 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:34:48,102 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-12-13 20:34:48,106 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/data/fc3a8e552/d833cd47a0ba4f7781622463e4db4962/FLAG59b76a98b [2022-12-13 20:34:48,513 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/data/fc3a8e552/d833cd47a0ba4f7781622463e4db4962 [2022-12-13 20:34:48,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:34:48,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:34:48,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:34:48,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:34:48,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:34:48,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f38b36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48, skipping insertion in model container [2022-12-13 20:34:48,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:34:48,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:34:48,630 WARN L237 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_79b1c932-4065-4592-a359-13ea382ee95c/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-12-13 20:34:48,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:34:48,644 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:34:48,652 WARN L237 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_79b1c932-4065-4592-a359-13ea382ee95c/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-12-13 20:34:48,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:34:48,664 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:34:48,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48 WrapperNode [2022-12-13 20:34:48,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:34:48,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:34:48,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:34:48,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:34:48,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,686 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2022-12-13 20:34:48,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:34:48,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:34:48,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:34:48,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:34:48,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:34:48,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:34:48,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:34:48,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:34:48,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (1/1) ... [2022-12-13 20:34:48,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:48,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:48,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 20:34:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:34:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:34:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:34:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:34:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:34:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:34:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:34:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:34:48,812 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:34:48,813 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:34:48,888 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:34:48,892 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:34:48,892 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:34:48,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:34:48 BoogieIcfgContainer [2022-12-13 20:34:48,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:34:48,894 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 20:34:48,894 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 20:34:48,896 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 20:34:48,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:34:48,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 08:34:48" (1/3) ... [2022-12-13 20:34:48,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ddc9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:34:48, skipping insertion in model container [2022-12-13 20:34:48,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:34:48,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:34:48" (2/3) ... [2022-12-13 20:34:48,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ddc9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:34:48, skipping insertion in model container [2022-12-13 20:34:48,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:34:48,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:34:48" (3/3) ... [2022-12-13 20:34:48,899 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2022-12-13 20:34:48,937 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 20:34:48,937 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 20:34:48,937 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 20:34:48,937 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 20:34:48,937 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 20:34:48,937 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 20:34:48,937 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 20:34:48,937 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 20:34:48,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:48,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-12-13 20:34:48,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:48,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:48,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:34:48,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:34:48,957 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 20:34:48,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:48,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-12-13 20:34:48,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:48,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:48,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:34:48,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:34:48,964 INFO L748 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true 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(24, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L18-3true [2022-12-13 20:34:48,965 INFO L750 eck$LassoCheckResult]: Loop: 12#L18-3true assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 11#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 12#L18-3true [2022-12-13 20:34:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 20:34:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765585358] [2022-12-13 20:34:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-12-13 20:34:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281912278] [2022-12-13 20:34:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-12-13 20:34:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:49,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203904456] [2022-12-13 20:34:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:49,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:49,367 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 20:34:49,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 20:34:49,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 20:34:49,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 20:34:49,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 20:34:49,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 20:34:49,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 20:34:49,369 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2022-12-13 20:34:49,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 20:34:49,369 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 20:34:49,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,553 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,555 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,558 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,560 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:34:49,704 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 20:34:49,707 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 20:34:49,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 20:34:49,712 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-12-13 20:34:49,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:34:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 20:34:49,744 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-12-13 20:34:49,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 20:34:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 20:34:49,771 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-12-13 20:34:49,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 20:34:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 20:34:49,796 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-12-13 20:34:49,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 20:34:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 20:34:49,821 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-12-13 20:34:49,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 20:34:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 20:34:49,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:34:49,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 20:34:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 20:34:49,869 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-12-13 20:34:49,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 20:34:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 20:34:49,893 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-12-13 20:34:49,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:34:49,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 20:34:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:49,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:49,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 20:34:49,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:34:49,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:34:49,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:34:49,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:34:49,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:34:49,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:34:49,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:34:49,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 20:34:49,963 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-12-13 20:34:49,963 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-12-13 20:34:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:34:49,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:50,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:34:50,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 20:34:50,002 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 20:34:50,015 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 20:34:50,015 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 20:34:50,016 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) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-12-13 20:34:50,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 20:34:50,034 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-12-13 20:34:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:34:50,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:34:50,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:50,140 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-12-13 20:34:50,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-12-13 20:34:50,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 41 transitions. Complement of second has 8 states. [2022-12-13 20:34:50,173 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-12-13 20:34:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-12-13 20:34:50,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2022-12-13 20:34:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:34:50,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2022-12-13 20:34:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:34:50,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-12-13 20:34:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:34:50,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2022-12-13 20:34:50,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 20:34:50,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2022-12-13 20:34:50,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-12-13 20:34:50,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-12-13 20:34:50,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-12-13 20:34:50,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:50,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 20:34:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-12-13 20:34:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-13 20:34:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-12-13 20:34:50,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 20:34:50,199 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 20:34:50,199 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 20:34:50,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-12-13 20:34:50,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 20:34:50,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:50,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:50,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-12-13 20:34:50,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 20:34:50,200 INFO L748 eck$LassoCheckResult]: Stem: 113#$Ultimate##0 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(24, 2); 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 108#L18-3 assume !(main_~i~0#1 < 100000); 109#L18-4 main_~i~0#1 := 0; 110#L22-3 [2022-12-13 20:34:50,200 INFO L750 eck$LassoCheckResult]: Loop: 110#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105#L13 assume !(0 == __VERIFIER_assert_~cond#1); 104#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 111#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 112#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 110#L22-3 [2022-12-13 20:34:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-12-13 20:34:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476471908] [2022-12-13 20:34:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 20:34:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:50,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476471908] [2022-12-13 20:34:50,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476471908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:34:50,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:34:50,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:34:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608648051] [2022-12-13 20:34:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:34:50,263 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:34:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2022-12-13 20:34:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096705997] [2022-12-13 20:34:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:34:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:34:50,383 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 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-12-13 20:34:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:50,403 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-12-13 20:34:50,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-12-13 20:34:50,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 20:34:50,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2022-12-13 20:34:50,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 20:34:50,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 20:34:50,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-12-13 20:34:50,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:50,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-12-13 20:34:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-12-13 20:34:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-12-13 20:34:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-12-13 20:34:50,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-12-13 20:34:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:34:50,408 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-12-13 20:34:50,408 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 20:34:50,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-12-13 20:34:50,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 20:34:50,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:50,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:50,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:34:50,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 20:34:50,410 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 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(24, 2); 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 144#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 142#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 143#L18-3 assume !(main_~i~0#1 < 100000); 145#L18-4 main_~i~0#1 := 0; 146#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 154#L13 assume !(0 == __VERIFIER_assert_~cond#1); 153#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 147#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 148#L22-2 [2022-12-13 20:34:50,410 INFO L750 eck$LassoCheckResult]: Loop: 148#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 152#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 140#L13 assume !(0 == __VERIFIER_assert_~cond#1); 141#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 149#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 148#L22-2 [2022-12-13 20:34:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2022-12-13 20:34:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664796587] [2022-12-13 20:34:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664796587] [2022-12-13 20:34:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664796587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:34:50,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680608870] [2022-12-13 20:34:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:34:50,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:50,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:34:50,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:34:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:34:50,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:50,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:34:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:50,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680608870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:34:50,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:34:50,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 20:34:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123539245] [2022-12-13 20:34:50,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:34:50,536 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:34:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2022-12-13 20:34:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989600420] [2022-12-13 20:34:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:34:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:34:50,672 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:50,717 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-12-13 20:34:50,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2022-12-13 20:34:50,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-12-13 20:34:50,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2022-12-13 20:34:50,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-12-13 20:34:50,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 20:34:50,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2022-12-13 20:34:50,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:50,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-12-13 20:34:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2022-12-13 20:34:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-12-13 20:34:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-12-13 20:34:50,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-12-13 20:34:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:34:50,723 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-12-13 20:34:50,724 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 20:34:50,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-12-13 20:34:50,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 20:34:50,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:50,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:50,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 20:34:50,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 20:34:50,725 INFO L748 eck$LassoCheckResult]: Stem: 263#$Ultimate##0 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(24, 2); 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 256#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 257#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 258#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 254#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 255#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 270#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 269#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 268#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 267#L18-3 assume !(main_~i~0#1 < 100000); 259#L18-4 main_~i~0#1 := 0; 260#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 273#L13 assume !(0 == __VERIFIER_assert_~cond#1); 271#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 272#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 274#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 275#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 277#L13 assume !(0 == __VERIFIER_assert_~cond#1); 276#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 261#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 262#L22-2 [2022-12-13 20:34:50,725 INFO L750 eck$LassoCheckResult]: Loop: 262#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 266#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 252#L13 assume !(0 == __VERIFIER_assert_~cond#1); 253#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 265#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 262#L22-2 [2022-12-13 20:34:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2022-12-13 20:34:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190256553] [2022-12-13 20:34:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:34:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190256553] [2022-12-13 20:34:50,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190256553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:34:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56505376] [2022-12-13 20:34:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:34:50,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:50,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:34:50,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:34:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:34:50,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:34:50,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:34:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:34:50,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56505376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:34:50,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:34:50,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 20:34:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292390065] [2022-12-13 20:34:50,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:34:50,958 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:34:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2022-12-13 20:34:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:50,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707371569] [2022-12-13 20:34:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:50,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 20:34:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:34:51,078 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:51,172 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-12-13 20:34:51,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2022-12-13 20:34:51,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-12-13 20:34:51,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2022-12-13 20:34:51,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-12-13 20:34:51,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-12-13 20:34:51,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2022-12-13 20:34:51,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:51,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-12-13 20:34:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2022-12-13 20:34:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-12-13 20:34:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-12-13 20:34:51,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-12-13 20:34:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:34:51,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-12-13 20:34:51,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 20:34:51,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2022-12-13 20:34:51,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 20:34:51,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:51,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:51,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2022-12-13 20:34:51,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 20:34:51,186 INFO L748 eck$LassoCheckResult]: Stem: 500#$Ultimate##0 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(24, 2); 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 493#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 494#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 495#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 491#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 492#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 518#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 516#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 514#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 512#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 510#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 508#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 507#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 506#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 505#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 504#L18-3 assume !(main_~i~0#1 < 100000); 496#L18-4 main_~i~0#1 := 0; 497#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 523#L13 assume !(0 == __VERIFIER_assert_~cond#1); 541#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 540#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 524#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 525#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 522#L13 assume !(0 == __VERIFIER_assert_~cond#1); 520#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 521#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 526#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 539#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 538#L13 assume !(0 == __VERIFIER_assert_~cond#1); 537#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 536#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 535#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 534#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 533#L13 assume !(0 == __VERIFIER_assert_~cond#1); 532#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 531#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 530#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 529#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 528#L13 assume !(0 == __VERIFIER_assert_~cond#1); 527#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 498#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 499#L22-2 [2022-12-13 20:34:51,186 INFO L750 eck$LassoCheckResult]: Loop: 499#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 503#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 489#L13 assume !(0 == __VERIFIER_assert_~cond#1); 490#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 502#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 499#L22-2 [2022-12-13 20:34:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2022-12-13 20:34:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:51,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621857928] [2022-12-13 20:34:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 20:34:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621857928] [2022-12-13 20:34:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621857928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:34:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143553558] [2022-12-13 20:34:51,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:34:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:34:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:51,465 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:34:51,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:34:51,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:34:51,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:34:51,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 20:34:51,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 20:34:51,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:34:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 20:34:51,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143553558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:34:51,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:34:51,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-13 20:34:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061798122] [2022-12-13 20:34:51,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:34:51,703 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:34:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2022-12-13 20:34:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142863852] [2022-12-13 20:34:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:51,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:51,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 20:34:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-13 20:34:51,800 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:52,004 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-12-13 20:34:52,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-12-13 20:34:52,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-12-13 20:34:52,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2022-12-13 20:34:52,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-12-13 20:34:52,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-12-13 20:34:52,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2022-12-13 20:34:52,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:52,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-12-13 20:34:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2022-12-13 20:34:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2022-12-13 20:34:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 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-12-13 20:34:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-12-13 20:34:52,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-12-13 20:34:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 20:34:52,016 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-12-13 20:34:52,016 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 20:34:52,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2022-12-13 20:34:52,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 20:34:52,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:34:52,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:34:52,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2022-12-13 20:34:52,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 20:34:52,020 INFO L748 eck$LassoCheckResult]: Stem: 1022#$Ultimate##0 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(24, 2); 1023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1015#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1016#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1017#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1013#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1014#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1065#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1064#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1063#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1062#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1061#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1060#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1059#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1058#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1057#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1056#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1055#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1054#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1053#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1052#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1051#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1050#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1049#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1048#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1047#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1046#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1045#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1044#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1043#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1042#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1041#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1040#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1039#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1038#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1037#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1036#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1035#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1034#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1033#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1032#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1031#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1030#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1029#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1028#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1027#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1026#L18-3 assume !(main_~i~0#1 < 100000); 1018#L18-4 main_~i~0#1 := 0; 1019#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1069#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1117#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1116#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1070#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1071#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1068#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1066#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1067#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1072#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1115#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1113#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1112#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1111#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1110#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1109#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1108#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1107#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1106#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1105#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1104#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1103#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1102#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1101#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1100#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1099#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1098#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1097#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1096#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1095#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1094#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1093#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1092#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1091#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1090#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1089#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1088#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1087#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1086#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1085#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1084#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1083#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1082#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1081#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1080#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1079#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1078#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1077#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1076#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1075#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1074#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1073#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1020#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1021#L22-2 [2022-12-13 20:34:52,020 INFO L750 eck$LassoCheckResult]: Loop: 1021#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1025#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1011#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1012#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1024#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1021#L22-2 [2022-12-13 20:34:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2022-12-13 20:34:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288437885] [2022-12-13 20:34:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-12-13 20:34:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:52,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288437885] [2022-12-13 20:34:52,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288437885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:34:52,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694924801] [2022-12-13 20:34:52,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:34:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:34:52,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:52,590 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:34:52,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:34:52,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 20:34:52,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:34:52,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 20:34:52,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:52,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 20:34:52,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 20:34:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-12-13 20:34:52,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:34:52,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694924801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:34:52,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:34:52,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2022-12-13 20:34:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939891745] [2022-12-13 20:34:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:34:52,750 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:34:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2022-12-13 20:34:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:52,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278173271] [2022-12-13 20:34:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:52,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:34:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:34:52,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:34:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:34:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2022-12-13 20:34:52,873 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:34:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:52,906 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-12-13 20:34:52,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2022-12-13 20:34:52,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 20:34:52,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-12-13 20:34:52,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 20:34:52,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 20:34:52,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 20:34:52,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:52,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:34:52,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:34:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:34:52,908 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:34:52,909 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 20:34:52,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 20:34:52,909 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 20:34:52,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 20:34:52,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 08:34:52 BoogieIcfgContainer [2022-12-13 20:34:52,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 20:34:52,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:34:52,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:34:52,916 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:34:52,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:34:48" (3/4) ... [2022-12-13 20:34:52,918 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 20:34:52,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:34:52,919 INFO L158 Benchmark]: Toolchain (without parser) took 4402.60ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 86.3MB in the beginning and 116.7MB in the end (delta: -30.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-12-13 20:34:52,919 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:34:52,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.33ms. Allocated memory is still 121.6MB. Free memory was 86.3MB in the beginning and 75.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:34:52,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.35ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 74.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:34:52,920 INFO L158 Benchmark]: Boogie Preprocessor took 14.54ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 73.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:34:52,920 INFO L158 Benchmark]: RCFGBuilder took 191.72ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 63.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 20:34:52,920 INFO L158 Benchmark]: BuchiAutomizer took 4021.54ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 63.2MB in the beginning and 117.7MB in the end (delta: -54.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:34:52,921 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 116.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:34:52,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.33ms. Allocated memory is still 121.6MB. Free memory was 86.3MB in the beginning and 75.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.35ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 74.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.54ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 73.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 191.72ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 63.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4021.54ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 63.2MB in the beginning and 117.7MB in the end (delta: -54.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 116.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 39 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp95 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-12-13 20:34:52,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 20:34:53,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:34:53,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 20:34:53,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:34:53,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b1c932-4065-4592-a359-13ea382ee95c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE