./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a 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_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- 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-5e519f3 [2022-11-02 20:50:45,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:45,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:45,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:45,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:45,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:45,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:45,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:45,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:45,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:45,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:45,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:45,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:45,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:45,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:45,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:45,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:45,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:45,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:45,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:45,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:45,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:45,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:45,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:45,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:45,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:45,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:45,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:45,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:45,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:45,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:45,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:45,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:45,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:45,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:45,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:45,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:45,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:45,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:45,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:45,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:45,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-02 20:50:45,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:45,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:45,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:45,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:45,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:45,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:45,969 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:45,970 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:50:45,970 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:50:45,970 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:50:45,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:50:45,971 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:50:45,972 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:50:45,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:45,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:50:45,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:45,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:45,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:50:45,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:50:45,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:50:45,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:45,973 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:50:45,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:45,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:50:45,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:45,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:45,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:45,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:45,977 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:50:45,977 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_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/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_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2022-11-02 20:50:46,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:46,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:46,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:46,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:46,363 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:46,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-11-02 20:50:46,447 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/data/f9b0557ff/8bbb992f9e474ee2a3f1d27505d29804/FLAG01cec221d [2022-11-02 20:50:47,063 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:47,064 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-11-02 20:50:47,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/data/f9b0557ff/8bbb992f9e474ee2a3f1d27505d29804/FLAG01cec221d [2022-11-02 20:50:47,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/data/f9b0557ff/8bbb992f9e474ee2a3f1d27505d29804 [2022-11-02 20:50:47,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:47,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:47,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:47,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:47,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:47,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acac34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47, skipping insertion in model container [2022-11-02 20:50:47,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:47,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:47,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:47,712 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:47,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:47,794 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:47,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47 WrapperNode [2022-11-02 20:50:47,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:47,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:47,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:47,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:47,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,848 INFO L138 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-11-02 20:50:47,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:47,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:47,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:47,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:47,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:47,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:47,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:47,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:47,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (1/1) ... [2022-11-02 20:50:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:47,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:47,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:50:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:48,176 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:48,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:48,356 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:48,361 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:48,362 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:50:48,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:48 BoogieIcfgContainer [2022-11-02 20:50:48,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:48,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:50:48,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:50:48,372 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:50:48,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:48,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:50:47" (1/3) ... [2022-11-02 20:50:48,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a6637a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:50:48, skipping insertion in model container [2022-11-02 20:50:48,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:48,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:47" (2/3) ... [2022-11-02 20:50:48,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a6637a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:50:48, skipping insertion in model container [2022-11-02 20:50:48,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:50:48,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:48" (3/3) ... [2022-11-02 20:50:48,379 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2022-11-02 20:50:48,439 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:50:48,439 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:50:48,439 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:50:48,439 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:50:48,439 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:50:48,440 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:50:48,440 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:50:48,440 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:50:48,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:48,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:48,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:48,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:48,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:48,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:50:48,490 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:50:48,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:48,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:48,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:48,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:48,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:50:48,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:50:48,502 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 4#L552-3true [2022-11-02 20:50:48,504 INFO L750 eck$LassoCheckResult]: Loop: 4#L552-3true goto; 7#L554-1true call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 4#L552-3true [2022-11-02 20:50:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 20:50:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:48,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235930703] [2022-11-02 20:50:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:48,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:48,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2022-11-02 20:50:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:48,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399448378] [2022-11-02 20:50:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:48,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:48,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2022-11-02 20:50:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:48,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108274071] [2022-11-02 20:50:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108274071] [2022-11-02 20:50:49,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108274071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:49,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:49,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892530246] [2022-11-02 20:50:49,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:49,561 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:49,595 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-11-02 20:50:49,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-11-02 20:50:49,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:49,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2022-11-02 20:50:49,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-02 20:50:49,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-02 20:50:49,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2022-11-02 20:50:49,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:49,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-02 20:50:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2022-11-02 20:50:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:50:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-02 20:50:49,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-02 20:50:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:49,639 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-02 20:50:49,640 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:50:49,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-11-02 20:50:49,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:49,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:49,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:49,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:50:49,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:50:49,643 INFO L748 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 41#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 42#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-11-02 20:50:49,644 INFO L750 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 46#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 44#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-11-02 20:50:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-11-02 20:50:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327177081] [2022-11-02 20:50:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-11-02 20:50:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593664163] [2022-11-02 20:50:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2022-11-02 20:50:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133030317] [2022-11-02 20:50:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:50,381 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:50:50,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:50:50,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:50:50,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:50:50,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:50:50,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:50,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:50:50,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:50:50,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2022-11-02 20:50:50,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:50:50,384 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:50:50,403 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,418 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,421 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,711 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,714 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,720 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,725 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,728 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,733 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,741 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,744 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,747 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:50,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:50:51,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:50:51,106 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:50:51,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 20:50:51,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:50:51,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:50:51,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:50:51,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 20:50:51,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:50:51,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:50:51,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:50:51,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 20:50:51,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 20:50:51,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 20:50:51,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 20:50:51,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,582 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 20:50:51,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:50:51,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:50:51,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:50:51,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:50:51,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:50:51,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:50:51,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 20:50:51,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:50:51,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:50:51,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:50:51,738 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-02 20:50:51,738 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-11-02 20:50:51,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:50:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:51,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:51,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:50:51,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 20:50:51,782 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:50:51,782 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:50:51,783 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2022-11-02 20:50:51,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:51,883 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-11-02 20:50:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:50:51,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:50:51,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:52,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-02 20:50:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:52,063 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:50:52,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:52,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2022-11-02 20:50:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:50:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-11-02 20:50:52,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2022-11-02 20:50:52,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:50:52,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-11-02 20:50:52,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:50:52,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2022-11-02 20:50:52,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:50:52,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-11-02 20:50:52,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:52,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2022-11-02 20:50:52,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-02 20:50:52,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-02 20:50:52,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-11-02 20:50:52,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:50:52,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-02 20:50:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-11-02 20:50:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-11-02 20:50:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-02 20:50:52,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-02 20:50:52,136 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-02 20:50:52,136 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:50:52,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-11-02 20:50:52,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:52,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:52,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:52,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-11-02 20:50:52,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:50:52,138 INFO L748 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 161#L552-3 goto; 168#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 167#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 166#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 165#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 159#L552-1 [2022-11-02 20:50:52,138 INFO L750 eck$LassoCheckResult]: Loop: 159#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 162#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 153#L552-3 goto; 154#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 159#L552-1 [2022-11-02 20:50:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2022-11-02 20:50:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:52,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016211630] [2022-11-02 20:50:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:52,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:52,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2022-11-02 20:50:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:52,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716212134] [2022-11-02 20:50:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:52,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:52,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2022-11-02 20:50:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:52,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393528699] [2022-11-02 20:50:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:52,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393528699] [2022-11-02 20:50:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393528699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081706852] [2022-11-02 20:50:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:52,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:52,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:50:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:52,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:50:52,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:52,656 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:50:52,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 20:50:52,686 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-11-02 20:50:52,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-11-02 20:50:52,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:50:52,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:52,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:50:52,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:52,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-11-02 20:50:52,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-11-02 20:50:52,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-02 20:50:52,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:52,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:50:52,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:50:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:53,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081706852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:53,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:53,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-11-02 20:50:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590942446] [2022-11-02 20:50:53,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:50:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:50:53,135 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:53,247 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-11-02 20:50:53,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2022-11-02 20:50:53,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:53,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2022-11-02 20:50:53,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-02 20:50:53,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-02 20:50:53,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2022-11-02 20:50:53,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:50:53,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-02 20:50:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2022-11-02 20:50:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-02 20:50:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-02 20:50:53,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-02 20:50:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:50:53,257 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-02 20:50:53,257 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:50:53,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2022-11-02 20:50:53,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:53,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:53,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:53,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2022-11-02 20:50:53,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:50:53,262 INFO L748 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 294#L552-3 goto; 303#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 302#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 298#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 290#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 292#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 293#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 307#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 306#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 305#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 304#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 300#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 295#L552-1 [2022-11-02 20:50:53,263 INFO L750 eck$LassoCheckResult]: Loop: 295#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 286#L552-3 goto; 287#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 295#L552-1 [2022-11-02 20:50:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2022-11-02 20:50:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:53,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921575305] [2022-11-02 20:50:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:53,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:53,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2022-11-02 20:50:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90159355] [2022-11-02 20:50:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:53,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:53,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2022-11-02 20:50:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:53,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500671504] [2022-11-02 20:50:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:54,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500671504] [2022-11-02 20:50:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500671504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:54,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706418321] [2022-11-02 20:50:54,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:50:54,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:54,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:54,088 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:54,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:50:54,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:50:54,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:54,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:50:54,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:54,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:50:54,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:54,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:50:54,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:50:54,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:50:54,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:50:54,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:50:54,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:50:54,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:50:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:54,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:54,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706418321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:54,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:54,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2022-11-02 20:50:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806162158] [2022-11-02 20:50:54,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:54,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:50:54,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:50:54,566 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:54,760 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-11-02 20:50:54,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2022-11-02 20:50:54,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:54,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2022-11-02 20:50:54,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-02 20:50:54,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-02 20:50:54,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2022-11-02 20:50:54,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:50:54,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-11-02 20:50:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2022-11-02 20:50:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-02 20:50:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-11-02 20:50:54,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-11-02 20:50:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:50:54,768 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-11-02 20:50:54,768 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:50:54,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-11-02 20:50:54,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-02 20:50:54,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:50:54,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:50:54,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2022-11-02 20:50:54,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:50:54,770 INFO L748 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 516#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 521#L552-3 goto; 531#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 530#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 525#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 517#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 518#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 552#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 519#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 520#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 524#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 526#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 551#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 550#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 549#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 548#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 547#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 546#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 545#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 544#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 543#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 541#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 540#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 538#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 537#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 536#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 535#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 534#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 533#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 532#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 528#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 522#L552-1 [2022-11-02 20:50:54,771 INFO L750 eck$LassoCheckResult]: Loop: 522#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 523#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 511#L552-3 goto; 512#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 522#L552-1 [2022-11-02 20:50:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2022-11-02 20:50:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873367372] [2022-11-02 20:50:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2022-11-02 20:50:54,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:54,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073189417] [2022-11-02 20:50:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2022-11-02 20:50:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:54,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454789687] [2022-11-02 20:50:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:54,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:05,354 WARN L234 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 203 DAG size of output: 165 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:51:05,527 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:51:05,527 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:51:05,527 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:51:05,527 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:51:05,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:51:05,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:05,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:51:05,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:51:05,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2022-11-02 20:51:05,528 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:51:05,528 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:51:05,531 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,535 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,540 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,543 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,863 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,866 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,868 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,871 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,874 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,877 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,880 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:05,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:51:06,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:51:06,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:51:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,194 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-02 20:51:06,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:51:06,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:51:06,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:51:06,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-11-02 20:51:06,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-02 20:51:06,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:51:06,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:51:06,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:51:06,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,293 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-02 20:51:06,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:51:06,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:51:06,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,370 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-02 20:51:06,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:51:06,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:51:06,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:51:06,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-11-02 20:51:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,423 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-02 20:51:06,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:51:06,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:51:06,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,507 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-02 20:51:06,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:51:06,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:51:06,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:51:06,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,591 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:51:06,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:51:06,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:51:06,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:51:06,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:51:06,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:51:06,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:51:06,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-02 20:51:06,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:51:06,658 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-11-02 20:51:06,658 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-11-02 20:51:06,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:51:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:06,663 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:06,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-02 20:51:06,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:51:06,690 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-02 20:51:06,690 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:51:06,691 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2) = -11*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 224 Supporting invariants [-22*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 23*ULTIMATE.start_main_#t~mem4#1 >= 0] [2022-11-02 20:51:06,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,763 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2022-11-02 20:51:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:51:06,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:06,963 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:51:06,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 20:51:06,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:06,995 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-11-02 20:51:06,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-11-02 20:51:07,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:07,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-02 20:51:07,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-11-02 20:51:07,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-02 20:51:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:07,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-11-02 20:51:07,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:07,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:51:07,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:51:07,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:07,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:51:07,671 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 20:51:07,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-11-02 20:51:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:07,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-11-02 20:51:07,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 5 states. [2022-11-02 20:51:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2022-11-02 20:51:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-11-02 20:51:07,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2022-11-02 20:51:07,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:07,832 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:51:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:51:07,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:07,960 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:51:07,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 20:51:07,988 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-11-02 20:51:07,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-11-02 20:51:07,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:08,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:08,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-02 20:51:08,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2022-11-02 20:51:08,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:51:08,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:51:08,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:08,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:51:08,730 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 20:51:08,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-11-02 20:51:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:08,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2022-11-02 20:51:08,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 45 transitions. Complement of second has 6 states. [2022-11-02 20:51:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-02 20:51:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-11-02 20:51:08,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2022-11-02 20:51:08,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:08,905 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:51:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:51:08,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:09,028 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:51:09,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 20:51:09,058 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-02 20:51:09,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-02 20:51:09,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:09,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:09,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2022-11-02 20:51:09,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-02 20:51:09,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:09,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-02 20:51:09,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:09,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:51:09,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:09,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:51:09,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:51:09,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:09,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:51:09,882 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 20:51:09,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-11-02 20:51:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:09,956 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-11-02 20:51:09,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:10,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 33 states. [2022-11-02 20:51:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2022-11-02 20:51:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-11-02 20:51:10,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 34 letters. Loop has 4 letters. [2022-11-02 20:51:10,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:10,322 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:51:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:10,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:51:10,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:10,440 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:51:10,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-02 20:51:10,477 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-11-02 20:51:10,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-11-02 20:51:10,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:10,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:51:10,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-02 20:51:10,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2022-11-02 20:51:10,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:10,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-11-02 20:51:10,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:51:10,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:10,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:51:10,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:10,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:11,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:51:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:11,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:51:11,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:11,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:51:11,156 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-02 20:51:11,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-11-02 20:51:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:11,222 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2022-11-02 20:51:11,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:11,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 62 transitions. Complement of second has 45 states. [2022-11-02 20:51:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:51:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-11-02 20:51:11,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 4 letters. [2022-11-02 20:51:11,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:11,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 38 letters. Loop has 4 letters. [2022-11-02 20:51:11,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:11,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 52 transitions. Stem has 34 letters. Loop has 8 letters. [2022-11-02 20:51:11,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:51:11,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 62 transitions. [2022-11-02 20:51:11,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 20:51:11,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-02 20:51:11,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-02 20:51:11,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:11,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:51:11,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:51:11,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 20:51:11,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-02 20:51:11,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:51:11 BoogieIcfgContainer [2022-11-02 20:51:11,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:51:11,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:51:11,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:51:11,550 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:51:11,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:48" (3/4) ... [2022-11-02 20:51:11,553 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:51:11,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:51:11,554 INFO L158 Benchmark]: Toolchain (without parser) took 24196.78ms. Allocated memory was 98.6MB in the beginning and 167.8MB in the end (delta: 69.2MB). Free memory was 56.0MB in the beginning and 65.2MB in the end (delta: -9.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,554 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:11,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.25ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 67.3MB in the end (delta: -11.6MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.58ms. Allocated memory is still 98.6MB. Free memory was 67.3MB in the beginning and 65.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,555 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 64.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,555 INFO L158 Benchmark]: RCFGBuilder took 459.48ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 53.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,555 INFO L158 Benchmark]: BuchiAutomizer took 23184.66ms. Allocated memory was 98.6MB in the beginning and 167.8MB in the end (delta: 69.2MB). Free memory was 53.7MB in the beginning and 65.2MB in the end (delta: -11.5MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2022-11-02 20:51:11,556 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 167.8MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:11,557 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.30ms. Allocated memory is still 98.6MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.25ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 67.3MB in the end (delta: -11.6MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.58ms. Allocated memory is still 98.6MB. Free memory was 67.3MB in the beginning and 65.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 64.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.48ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 53.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 23184.66ms. Allocated memory was 98.6MB in the beginning and 167.8MB in the end (delta: 69.2MB). Free memory was 53.7MB in the beginning and 65.2MB in the end (delta: -11.5MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 167.8MB. Free memory is still 65.2MB. 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 5 terminating modules (3 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 19 + -2 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One nondeterministic module has affine ranking function -11 * unknown-#memory_int-unknown[i][i] + 224 and consists of 15 locations. 3 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.1s and 6 iterations. TraceHistogramMax:11. Analysis of lassos took 17.5s. Construction of modules took 0.3s. Büchi inclusion checks took 5.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 60 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax107 hnf100 lsp89 ukn49 mio100 lsp39 div100 bol100 ite100 ukn100 eq183 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 5 VariablesLoop: 4 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-11-02 20:51:11,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:11,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:11,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17325bd-9e15-4616-bad1-f01b8e05b472/bin/uautomizer-Dbtcem3rbc/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