./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 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_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS --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 bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- 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-4e7fbc6 [2022-11-23 01:45:09,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:45:09,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:45:09,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:45:09,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:45:09,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:45:09,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:45:09,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:45:09,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:45:09,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:45:09,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:45:09,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:45:09,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:45:09,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:45:09,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:45:09,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:45:09,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:45:09,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:45:09,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:45:09,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:45:09,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:45:09,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:45:09,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:45:09,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:45:09,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:45:09,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:45:09,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:45:09,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:45:09,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:45:09,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:45:09,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:45:09,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:45:09,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:45:09,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:45:09,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:45:09,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:45:09,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:45:09,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:45:09,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:45:09,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:45:09,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:45:09,872 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-23 01:45:09,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:45:09,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:45:09,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:45:09,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:45:09,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:45:09,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:45:09,914 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:45:09,914 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 01:45:09,914 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 01:45:09,915 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 01:45:09,916 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 01:45:09,916 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 01:45:09,916 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 01:45:09,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:45:09,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:45:09,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:45:09,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:45:09,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 01:45:09,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 01:45:09,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 01:45:09,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:45:09,919 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 01:45:09,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:45:09,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 01:45:09,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:45:09,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:45:09,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:45:09,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:45:09,922 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 01:45:09,923 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_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/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_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS 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 -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2022-11-23 01:45:10,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:45:10,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:45:10,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:45:10,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:45:10,284 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:45:10,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/termination-15/array13_alloca.i [2022-11-23 01:45:13,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:45:13,817 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:45:13,818 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/sv-benchmarks/c/termination-15/array13_alloca.i [2022-11-23 01:45:13,831 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/data/5f985d09b/028f17995aa74cf6b0250be6ca0a203a/FLAGd7058b3c9 [2022-11-23 01:45:13,851 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/data/5f985d09b/028f17995aa74cf6b0250be6ca0a203a [2022-11-23 01:45:13,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:45:13,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:45:13,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:45:13,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:45:13,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:45:13,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:13" (1/1) ... [2022-11-23 01:45:13,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c578f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:13, skipping insertion in model container [2022-11-23 01:45:13,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:13" (1/1) ... [2022-11-23 01:45:13,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:45:13,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:45:14,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:45:14,256 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:45:14,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:45:14,316 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:45:14,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14 WrapperNode [2022-11-23 01:45:14,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:45:14,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:45:14,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:45:14,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:45:14,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,352 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-23 01:45:14,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:45:14,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:45:14,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:45:14,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:45:14,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,372 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:45:14,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:45:14,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:45:14,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:45:14,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (1/1) ... [2022-11-23 01:45:14,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:14,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:14,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:14,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 01:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:45:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:45:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:45:14,571 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:45:14,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:45:14,749 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:45:14,754 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:45:14,755 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 01:45:14,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:14 BoogieIcfgContainer [2022-11-23 01:45:14,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:45:14,758 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 01:45:14,758 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 01:45:14,762 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 01:45:14,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:45:14,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:45:13" (1/3) ... [2022-11-23 01:45:14,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ba8c610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:45:14, skipping insertion in model container [2022-11-23 01:45:14,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:45:14,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:14" (2/3) ... [2022-11-23 01:45:14,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ba8c610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:45:14, skipping insertion in model container [2022-11-23 01:45:14,765 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:45:14,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:14" (3/3) ... [2022-11-23 01:45:14,767 INFO L332 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2022-11-23 01:45:14,818 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 01:45:14,818 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 01:45:14,818 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 01:45:14,819 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 01:45:14,819 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 01:45:14,819 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 01:45:14,819 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 01:45:14,819 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 01:45:14,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:14,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-23 01:45:14,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:14,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:14,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-23 01:45:14,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 01:45:14,874 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 01:45:14,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:14,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-23 01:45:14,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:14,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:14,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-23 01:45:14,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 01:45:14,893 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; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 10#L367true assume !(main_~length~0#1 < 1); 7#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 4#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5#L370-3true [2022-11-23 01:45:14,894 INFO L750 eck$LassoCheckResult]: Loop: 5#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 5#L370-3true [2022-11-23 01:45:14,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-11-23 01:45:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:14,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848698285] [2022-11-23 01:45:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-11-23 01:45:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190666587] [2022-11-23 01:45:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-11-23 01:45:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348751263] [2022-11-23 01:45:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:15,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:15,519 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 01:45:15,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 01:45:15,520 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 01:45:15,520 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 01:45:15,520 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-23 01:45:15,520 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:15,520 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 01:45:15,521 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 01:45:15,521 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2022-11-23 01:45:15,521 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 01:45:15,521 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 01:45:15,541 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-23 01:45:15,552 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:45:15,559 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-23 01:45:15,564 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:45:15,567 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-23 01:45:15,570 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-23 01:45:15,822 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-23 01:45:15,825 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-23 01:45:15,827 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-23 01:45:15,830 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-23 01:45:15,833 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-23 01:45:15,836 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-23 01:45:16,139 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-23 01:45:16,145 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-23 01:45:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,162 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-23 01:45:16,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:16,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:16,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:16,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-23 01:45:16,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,211 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-23 01:45:16,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:16,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:16,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-23 01:45:16,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,265 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-23 01:45:16,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-23 01:45:16,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:16,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:16,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-11-23 01:45:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-23 01:45:16,297 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-23 01:45:16,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:16,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:16,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:16,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-23 01:45:16,324 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-23 01:45:16,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:16,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:16,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:16,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-23 01:45:16,360 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-23 01:45:16,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:16,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:16,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:16,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-23 01:45:16,400 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-23 01:45:16,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:16,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:16,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-11-23 01:45:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-23 01:45:16,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:45:16,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:16,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:16,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:16,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,515 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-23 01:45:16,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:16,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:16,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:16,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:16,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-23 01:45:16,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:16,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:16,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-23 01:45:16,603 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-11-23 01:45:16,603 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-23 01:45:16,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:16,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:16,646 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:16,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-23 01:45:16,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-23 01:45:16,679 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-23 01:45:16,680 INFO L513 LassoAnalysis]: Proved termination. [2022-11-23 01:45:16,680 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-11-23 01:45:16,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:16,708 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-23 01:45:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:16,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 01:45:16,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:16,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 01:45:16,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:16,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-23 01:45:16,900 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-23 01:45:16,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:16,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-11-23 01:45:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-23 01:45:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-23 01:45:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-11-23 01:45:16,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:16,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-11-23 01:45:16,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:16,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-11-23 01:45:16,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:16,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-11-23 01:45:16,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:16,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-11-23 01:45:16,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-23 01:45:16,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-23 01:45:16,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-11-23 01:45:16,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:16,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-23 01:45:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-11-23 01:45:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-23 01:45:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-11-23 01:45:16,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-23 01:45:16,997 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-23 01:45:16,997 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 01:45:16,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-11-23 01:45:16,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:16,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:16,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:16,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:16,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:16,999 INFO L748 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 120#L367 assume !(main_~length~0#1 < 1); 114#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 115#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 116#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 117#L370-4 main_~j~0#1 := 0; 118#L378-2 [2022-11-23 01:45:16,999 INFO L750 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 119#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 118#L378-2 [2022-11-23 01:45:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-11-23 01:45:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:17,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452525862] [2022-11-23 01:45:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:17,077 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-23 01:45:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:17,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452525862] [2022-11-23 01:45:17,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452525862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:45:17,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:45:17,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:45:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205124271] [2022-11-23 01:45:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:45:17,082 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:45:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-11-23 01:45:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:17,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6879949] [2022-11-23 01:45:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:17,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:45:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:45:17,152 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:17,192 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-11-23 01:45:17,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-11-23 01:45:17,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:17,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-11-23 01:45:17,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-23 01:45:17,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-23 01:45:17,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-11-23 01:45:17,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:17,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-23 01:45:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-11-23 01:45:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-23 01:45:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-23 01:45:17,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-23 01:45:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:45:17,204 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-23 01:45:17,204 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 01:45:17,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-23 01:45:17,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:17,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:17,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:17,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:17,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:17,208 INFO L748 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 153#L367 assume !(main_~length~0#1 < 1); 147#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 148#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 149#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 154#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 156#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 155#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 150#L370-4 main_~j~0#1 := 0; 151#L378-2 [2022-11-23 01:45:17,208 INFO L750 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 152#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 151#L378-2 [2022-11-23 01:45:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-11-23 01:45:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:17,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238306083] [2022-11-23 01:45:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-11-23 01:45:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:17,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662374952] [2022-11-23 01:45:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:17,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-11-23 01:45:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:17,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475956643] [2022-11-23 01:45:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:17,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:17,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475956643] [2022-11-23 01:45:17,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475956643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:17,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88597891] [2022-11-23 01:45:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:17,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:17,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:17,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:17,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 01:45:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:17,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 01:45:17,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:17,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 01:45:17,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:17,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:18,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-23 01:45:18,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-23 01:45:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:18,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88597891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:18,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:18,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-11-23 01:45:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725060786] [2022-11-23 01:45:18,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 01:45:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-23 01:45:18,141 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:18,279 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-23 01:45:18,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-23 01:45:18,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:45:18,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-23 01:45:18,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-23 01:45:18,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-23 01:45:18,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-23 01:45:18,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:18,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-23 01:45:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-23 01:45:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-11-23 01:45:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-23 01:45:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-11-23 01:45:18,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-23 01:45:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 01:45:18,286 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-23 01:45:18,286 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 01:45:18,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-11-23 01:45:18,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:18,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:18,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:18,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:18,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:18,289 INFO L748 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 277#L367 assume !(main_~length~0#1 < 1); 271#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 272#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 273#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 278#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 283#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 279#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 280#L370-4 main_~j~0#1 := 0; 284#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 274#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 275#L378-2 [2022-11-23 01:45:18,289 INFO L750 eck$LassoCheckResult]: Loop: 275#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 282#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 275#L378-2 [2022-11-23 01:45:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-11-23 01:45:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:18,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068766260] [2022-11-23 01:45:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:18,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:18,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-11-23 01:45:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:18,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216227025] [2022-11-23 01:45:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:18,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:18,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-11-23 01:45:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950129556] [2022-11-23 01:45:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950129556] [2022-11-23 01:45:18,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950129556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219933203] [2022-11-23 01:45:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:18,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:18,408 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:18,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 01:45:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:18,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:45:18,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:18,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:18,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219933203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:18,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:18,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-23 01:45:18,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162543828] [2022-11-23 01:45:18,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 01:45:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-23 01:45:18,662 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:18,785 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-11-23 01:45:18,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-11-23 01:45:18,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:45:18,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2022-11-23 01:45:18,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-23 01:45:18,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-23 01:45:18,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-11-23 01:45:18,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:18,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-23 01:45:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-11-23 01:45:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-11-23 01:45:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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-23 01:45:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-11-23 01:45:18,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-23 01:45:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 01:45:18,802 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-23 01:45:18,802 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-23 01:45:18,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-11-23 01:45:18,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:45:18,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:18,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:18,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:18,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:18,805 INFO L748 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 444#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 445#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 461#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 460#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 457#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 455#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 456#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 458#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 453#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 440#L370-4 main_~j~0#1 := 0; 441#L378-2 [2022-11-23 01:45:18,805 INFO L750 eck$LassoCheckResult]: Loop: 441#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 451#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 441#L378-2 [2022-11-23 01:45:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-11-23 01:45:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450031066] [2022-11-23 01:45:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450031066] [2022-11-23 01:45:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450031066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540247451] [2022-11-23 01:45:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:18,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:18,920 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:18,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 01:45:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:18,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 01:45:18,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:19,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:45:19,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540247451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:45:19,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:45:19,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 01:45:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701641611] [2022-11-23 01:45:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:45:19,028 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:45:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-11-23 01:45:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884672688] [2022-11-23 01:45:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:45:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:45:19,100 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:19,128 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-11-23 01:45:19,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-11-23 01:45:19,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:19,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-11-23 01:45:19,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-23 01:45:19,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-23 01:45:19,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-11-23 01:45:19,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:19,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-23 01:45:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-11-23 01:45:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 01:45:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-23 01:45:19,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-23 01:45:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:45:19,142 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-23 01:45:19,142 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-23 01:45:19,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-11-23 01:45:19,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:19,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:19,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:19,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:19,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:19,146 INFO L748 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 551#L367 assume !(main_~length~0#1 < 1); 544#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 545#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 546#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 555#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 553#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 554#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 561#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 558#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 557#L370-4 main_~j~0#1 := 0; 550#L378-2 [2022-11-23 01:45:19,147 INFO L750 eck$LassoCheckResult]: Loop: 550#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 556#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 550#L378-2 [2022-11-23 01:45:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-11-23 01:45:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:19,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675119300] [2022-11-23 01:45:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-11-23 01:45:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:19,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602552697] [2022-11-23 01:45:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:19,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-11-23 01:45:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:19,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479216344] [2022-11-23 01:45:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479216344] [2022-11-23 01:45:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479216344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210219120] [2022-11-23 01:45:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:19,610 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:19,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 01:45:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:19,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 01:45:19,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:19,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:19,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 01:45:19,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:19,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 01:45:19,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:19,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:20,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-23 01:45:20,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-11-23 01:45:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210219120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:20,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-23 01:45:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156009421] [2022-11-23 01:45:20,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 01:45:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-23 01:45:20,156 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:20,316 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-11-23 01:45:20,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-11-23 01:45:20,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:20,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2022-11-23 01:45:20,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-23 01:45:20,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-23 01:45:20,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-11-23 01:45:20,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:20,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-23 01:45:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-11-23 01:45:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-11-23 01:45:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-23 01:45:20,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-23 01:45:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:45:20,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-23 01:45:20,321 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-23 01:45:20,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-11-23 01:45:20,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:20,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:20,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:20,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:20,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:20,322 INFO L748 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 707#L367 assume !(main_~length~0#1 < 1); 698#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 699#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 702#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 708#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 713#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 709#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 710#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 711#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 712#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 703#L370-4 main_~j~0#1 := 0; 704#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 705#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 706#L378-2 [2022-11-23 01:45:20,322 INFO L750 eck$LassoCheckResult]: Loop: 706#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 714#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 706#L378-2 [2022-11-23 01:45:20,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-11-23 01:45:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:20,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964582183] [2022-11-23 01:45:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:20,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:20,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-11-23 01:45:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:20,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942465276] [2022-11-23 01:45:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:20,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:20,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-11-23 01:45:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:20,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630637114] [2022-11-23 01:45:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630637114] [2022-11-23 01:45:20,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630637114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056337513] [2022-11-23 01:45:20,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 01:45:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:20,519 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:20,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 01:45:20,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 01:45:20,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:20,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 01:45:20,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:20,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 01:45:20,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:20,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:20,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 01:45:20,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-23 01:45:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056337513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:20,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-23 01:45:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673870210] [2022-11-23 01:45:20,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:20,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 01:45:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-23 01:45:20,917 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:21,100 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-23 01:45:21,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-11-23 01:45:21,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:45:21,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-11-23 01:45:21,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-23 01:45:21,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-23 01:45:21,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-23 01:45:21,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:21,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-23 01:45:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-23 01:45:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-11-23 01:45:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-11-23 01:45:21,105 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-23 01:45:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 01:45:21,107 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-23 01:45:21,107 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-23 01:45:21,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-11-23 01:45:21,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:21,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:21,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:21,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:21,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:21,108 INFO L748 eck$LassoCheckResult]: Stem: 872#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 880#L367 assume !(main_~length~0#1 < 1); 874#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 875#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 876#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 881#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 889#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 882#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 883#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 884#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 886#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 887#L370-4 main_~j~0#1 := 0; 892#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 879#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 878#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L378-2 [2022-11-23 01:45:21,109 INFO L750 eck$LassoCheckResult]: Loop: 891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 890#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 891#L378-2 [2022-11-23 01:45:21,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-11-23 01:45:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360121419] [2022-11-23 01:45:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-11-23 01:45:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871659597] [2022-11-23 01:45:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-11-23 01:45:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285957867] [2022-11-23 01:45:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:21,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285957867] [2022-11-23 01:45:21,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285957867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:21,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987042645] [2022-11-23 01:45:21,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 01:45:21,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:21,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:21,310 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:21,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 01:45:21,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 01:45:21,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:21,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 01:45:21,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:21,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987042645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:21,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-23 01:45:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748099803] [2022-11-23 01:45:21,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:21,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 01:45:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-23 01:45:21,568 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:21,667 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-23 01:45:21,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-11-23 01:45:21,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:21,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-11-23 01:45:21,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-23 01:45:21,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-23 01:45:21,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-23 01:45:21,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:21,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-23 01:45:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-23 01:45:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-11-23 01:45:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-23 01:45:21,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 01:45:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:45:21,677 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-23 01:45:21,677 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-23 01:45:21,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-11-23 01:45:21,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:21,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:21,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:21,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:21,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:21,680 INFO L748 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1075#L367 assume !(main_~length~0#1 < 1); 1066#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1067#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1070#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1091#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1090#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1079#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1080#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1077#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1078#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1086#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1085#L370-4 main_~j~0#1 := 0; 1074#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1084#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1083#L378-2 [2022-11-23 01:45:21,681 INFO L750 eck$LassoCheckResult]: Loop: 1083#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1082#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1083#L378-2 [2022-11-23 01:45:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-11-23 01:45:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848080612] [2022-11-23 01:45:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-11-23 01:45:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086839397] [2022-11-23 01:45:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:21,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-11-23 01:45:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:21,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246993539] [2022-11-23 01:45:21,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246993539] [2022-11-23 01:45:21,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246993539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809949426] [2022-11-23 01:45:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:22,007 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:22,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 01:45:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:22,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 01:45:22,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:22,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:22,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 01:45:22,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 01:45:22,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:22,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:22,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-23 01:45:22,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-11-23 01:45:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809949426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:22,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:22,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-11-23 01:45:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126659567] [2022-11-23 01:45:22,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 01:45:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-11-23 01:45:22,615 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 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-23 01:45:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:22,992 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-11-23 01:45:22,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2022-11-23 01:45:22,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-23 01:45:22,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2022-11-23 01:45:22,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-23 01:45:22,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-23 01:45:22,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2022-11-23 01:45:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:22,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-11-23 01:45:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2022-11-23 01:45:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-11-23 01:45:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 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-23 01:45:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-11-23 01:45:22,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-23 01:45:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 01:45:23,004 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-23 01:45:23,005 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-23 01:45:23,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2022-11-23 01:45:23,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:23,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:23,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:23,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:23,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:23,008 INFO L748 eck$LassoCheckResult]: Stem: 1333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1341#L367 assume !(main_~length~0#1 < 1); 1335#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1336#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1337#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1342#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1353#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1354#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1355#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1343#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1344#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1346#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1373#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1351#L370-4 main_~j~0#1 := 0; 1359#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1338#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1339#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1345#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1358#L378-2 [2022-11-23 01:45:23,008 INFO L750 eck$LassoCheckResult]: Loop: 1358#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1357#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1358#L378-2 [2022-11-23 01:45:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2022-11-23 01:45:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:23,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59957849] [2022-11-23 01:45:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:23,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:23,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-11-23 01:45:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885505568] [2022-11-23 01:45:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:23,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:23,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:23,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2022-11-23 01:45:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:23,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307985149] [2022-11-23 01:45:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307985149] [2022-11-23 01:45:23,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307985149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757533163] [2022-11-23 01:45:23,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 01:45:23,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:23,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:23,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:23,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 01:45:23,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 01:45:23,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:23,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 01:45:23,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:23,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 01:45:23,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:23,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:23,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 01:45:23,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-23 01:45:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757533163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:23,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:23,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-11-23 01:45:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396016155] [2022-11-23 01:45:23,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 01:45:23,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-11-23 01:45:23,891 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 20 Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 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-23 01:45:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:24,232 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-23 01:45:24,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2022-11-23 01:45:24,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:45:24,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2022-11-23 01:45:24,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-23 01:45:24,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-23 01:45:24,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2022-11-23 01:45:24,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:24,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-11-23 01:45:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2022-11-23 01:45:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-23 01:45:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-11-23 01:45:24,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-23 01:45:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 01:45:24,242 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-23 01:45:24,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-23 01:45:24,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2022-11-23 01:45:24,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:45:24,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:24,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:24,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:24,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:24,244 INFO L748 eck$LassoCheckResult]: Stem: 1591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1592#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1599#L367 assume !(main_~length~0#1 < 1); 1593#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1594#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1595#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1600#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1611#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1612#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1601#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1602#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1604#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1634#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1596#L370-4 main_~j~0#1 := 0; 1597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1618#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1616#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1615#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1610#L378-2 [2022-11-23 01:45:24,245 INFO L750 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2022-11-23 01:45:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-11-23 01:45:24,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:24,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370792518] [2022-11-23 01:45:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:24,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:24,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-11-23 01:45:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830222877] [2022-11-23 01:45:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:24,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:24,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:24,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-11-23 01:45:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102875534] [2022-11-23 01:45:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102875534] [2022-11-23 01:45:24,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102875534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:24,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903358743] [2022-11-23 01:45:24,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 01:45:24,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:24,558 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:24,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 01:45:24,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 01:45:24,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:24,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 01:45:24,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:24,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:24,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 01:45:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:24,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:24,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 01:45:24,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-23 01:45:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:24,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903358743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:24,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:24,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-11-23 01:45:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322239142] [2022-11-23 01:45:24,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 01:45:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-23 01:45:24,994 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. cyclomatic complexity: 20 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:25,190 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-23 01:45:25,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-23 01:45:25,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-11-23 01:45:25,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-23 01:45:25,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-23 01:45:25,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-23 01:45:25,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-23 01:45:25,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:25,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-23 01:45:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-23 01:45:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-11-23 01:45:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 58 states have internal predecessors, (83), 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-23 01:45:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2022-11-23 01:45:25,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-23 01:45:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 01:45:25,199 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-23 01:45:25,199 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-23 01:45:25,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2022-11-23 01:45:25,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:25,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:25,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:25,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:25,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:25,201 INFO L748 eck$LassoCheckResult]: Stem: 1857#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1865#L367 assume !(main_~length~0#1 < 1); 1859#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1860#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1861#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1866#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1873#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1874#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1878#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1879#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1867#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1868#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1902#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1876#L370-4 main_~j~0#1 := 0; 1909#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1864#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1863#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1872#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1883#L378-2 [2022-11-23 01:45:25,202 INFO L750 eck$LassoCheckResult]: Loop: 1883#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1884#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1883#L378-2 [2022-11-23 01:45:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2022-11-23 01:45:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677005187] [2022-11-23 01:45:25,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-11-23 01:45:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763091042] [2022-11-23 01:45:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2022-11-23 01:45:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598583664] [2022-11-23 01:45:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598583664] [2022-11-23 01:45:25,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598583664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793067682] [2022-11-23 01:45:25,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 01:45:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:25,379 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:25,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 01:45:25,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 01:45:25,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:25,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 01:45:25,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:25,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:25,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793067682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:25,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:25,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-23 01:45:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183483803] [2022-11-23 01:45:25,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 01:45:25,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-23 01:45:25,710 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. cyclomatic complexity: 29 Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:25,862 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-11-23 01:45:25,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2022-11-23 01:45:25,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:25,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2022-11-23 01:45:25,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-11-23 01:45:25,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-11-23 01:45:25,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2022-11-23 01:45:25,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:25,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-23 01:45:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2022-11-23 01:45:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-23 01:45:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 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-23 01:45:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-23 01:45:25,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-23 01:45:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 01:45:25,869 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-23 01:45:25,869 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-23 01:45:25,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-23 01:45:25,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:25,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:25,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:25,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:25,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:25,871 INFO L748 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2162#L367 assume !(main_~length~0#1 < 1); 2155#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2156#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2157#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2163#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2166#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2164#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2165#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2211#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2209#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2208#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2206#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2204#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2201#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2198#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2189#L370-4 main_~j~0#1 := 0; 2161#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2182#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2172#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2176#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2175#L378-2 [2022-11-23 01:45:25,871 INFO L750 eck$LassoCheckResult]: Loop: 2175#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2174#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2175#L378-2 [2022-11-23 01:45:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2022-11-23 01:45:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874884835] [2022-11-23 01:45:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:25,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-11-23 01:45:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399999514] [2022-11-23 01:45:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:25,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2022-11-23 01:45:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184165216] [2022-11-23 01:45:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184165216] [2022-11-23 01:45:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184165216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096701640] [2022-11-23 01:45:26,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 01:45:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:26,279 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:26,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 01:45:26,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 01:45:26,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:26,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 01:45:26,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:26,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:26,478 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-23 01:45:26,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-23 01:45:26,505 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-23 01:45:26,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-23 01:45:26,716 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-23 01:45:26,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-11-23 01:45:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:26,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-23 01:45:27,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-23 01:45:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:27,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096701640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:27,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:27,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-23 01:45:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442625284] [2022-11-23 01:45:27,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 01:45:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-11-23 01:45:27,186 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 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-23 01:45:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:27,641 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-11-23 01:45:27,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2022-11-23 01:45:27,642 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-11-23 01:45:27,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2022-11-23 01:45:27,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-11-23 01:45:27,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-11-23 01:45:27,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2022-11-23 01:45:27,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:27,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-11-23 01:45:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2022-11-23 01:45:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-11-23 01:45:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 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-23 01:45:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-23 01:45:27,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-23 01:45:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 01:45:27,658 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-23 01:45:27,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-23 01:45:27,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-23 01:45:27,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:27,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:27,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:27,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:27,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:27,663 INFO L748 eck$LassoCheckResult]: Stem: 2486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2495#L367 assume !(main_~length~0#1 < 1); 2488#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2489#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2490#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2496#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2506#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2507#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2508#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2504#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2505#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2511#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2512#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2497#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2498#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2499#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2501#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2502#L370-4 main_~j~0#1 := 0; 2492#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2534#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2515#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2518#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2516#L378-2 [2022-11-23 01:45:27,663 INFO L750 eck$LassoCheckResult]: Loop: 2516#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2517#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2516#L378-2 [2022-11-23 01:45:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2022-11-23 01:45:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:27,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16615582] [2022-11-23 01:45:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:27,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:27,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2022-11-23 01:45:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988708200] [2022-11-23 01:45:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:27,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:27,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2022-11-23 01:45:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:27,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395432739] [2022-11-23 01:45:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395432739] [2022-11-23 01:45:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395432739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:28,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64851338] [2022-11-23 01:45:28,083 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 01:45:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:28,087 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:28,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 01:45:28,172 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-23 01:45:28,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:28,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 01:45:28,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:28,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:28,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:28,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 01:45:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:28,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 01:45:28,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 01:45:28,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:45:28,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-23 01:45:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:28,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:28,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-23 01:45:28,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-23 01:45:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:28,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64851338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:28,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:28,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2022-11-23 01:45:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503903566] [2022-11-23 01:45:28,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 01:45:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-11-23 01:45:28,907 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 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-23 01:45:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:29,340 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-23 01:45:29,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2022-11-23 01:45:29,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-23 01:45:29,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2022-11-23 01:45:29,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-23 01:45:29,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-23 01:45:29,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2022-11-23 01:45:29,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:29,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-11-23 01:45:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2022-11-23 01:45:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-11-23 01:45:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 48 states have internal predecessors, (66), 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-23 01:45:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-11-23 01:45:29,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-23 01:45:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 01:45:29,347 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-23 01:45:29,347 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-23 01:45:29,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2022-11-23 01:45:29,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:29,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:29,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:29,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:29,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:29,349 INFO L748 eck$LassoCheckResult]: Stem: 2807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2808#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2816#L367 assume !(main_~length~0#1 < 1); 2809#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2810#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2811#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2817#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2834#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2829#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2828#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2822#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2823#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2832#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2833#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2819#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2855#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2846#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2812#L370-4 main_~j~0#1 := 0; 2813#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2814#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2815#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2844#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2837#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2839#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2840#L378-2 [2022-11-23 01:45:29,349 INFO L750 eck$LassoCheckResult]: Loop: 2840#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2841#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2840#L378-2 [2022-11-23 01:45:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2022-11-23 01:45:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:29,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188511475] [2022-11-23 01:45:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:29,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:29,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:29,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2022-11-23 01:45:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:29,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658234740] [2022-11-23 01:45:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:29,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:29,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2022-11-23 01:45:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:29,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657732884] [2022-11-23 01:45:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:29,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657732884] [2022-11-23 01:45:29,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657732884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660210067] [2022-11-23 01:45:29,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 01:45:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:29,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:29,663 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:29,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 01:45:29,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-23 01:45:29,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:45:29,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 01:45:29,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:29,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:30,262 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 01:45:30,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-23 01:45:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:30,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:30,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-23 01:45:30,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-23 01:45:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:30,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660210067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:30,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:30,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-11-23 01:45:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107146567] [2022-11-23 01:45:30,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:30,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 01:45:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 01:45:30,946 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 21 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:32,929 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-11-23 01:45:32,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-11-23 01:45:32,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-11-23 01:45:32,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2022-11-23 01:45:32,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-23 01:45:32,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-23 01:45:32,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2022-11-23 01:45:32,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:32,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-23 01:45:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2022-11-23 01:45:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-11-23 01:45:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-11-23 01:45:32,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-23 01:45:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 01:45:32,942 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-23 01:45:32,942 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-23 01:45:32,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2022-11-23 01:45:32,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:32,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:32,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:32,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:32,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:32,947 INFO L748 eck$LassoCheckResult]: Stem: 3159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3167#L367 assume !(main_~length~0#1 < 1); 3161#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3162#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3163#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3168#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3179#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3180#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3181#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3177#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3178#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3184#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3185#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3169#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3170#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3172#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3175#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3164#L370-4 main_~j~0#1 := 0; 3165#L378-2 [2022-11-23 01:45:32,947 INFO L750 eck$LassoCheckResult]: Loop: 3165#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3166#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3165#L378-2 [2022-11-23 01:45:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2022-11-23 01:45:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573261060] [2022-11-23 01:45:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-11-23 01:45:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:32,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83966223] [2022-11-23 01:45:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2022-11-23 01:45:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:32,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745106942] [2022-11-23 01:45:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:32,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:34,027 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 01:45:34,027 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 01:45:34,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 01:45:34,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 01:45:34,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-23 01:45:34,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 01:45:34,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 01:45:34,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration16_Lasso [2022-11-23 01:45:34,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 01:45:34,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 01:45:34,039 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-23 01:45:34,045 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-23 01:45:34,048 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-23 01:45:34,051 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-23 01:45:34,320 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-23 01:45:34,322 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-23 01:45:34,324 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-23 01:45:34,326 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-23 01:45:34,328 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-23 01:45:34,329 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-23 01:45:34,331 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-23 01:45:34,333 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-23 01:45:34,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-23 01:45:34,622 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-23 01:45:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,628 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-23 01:45:34,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:45:34,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,654 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-23 01:45:34,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:45:34,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:45:34,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:45:34,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:45:34,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,677 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-23 01:45:34,684 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-23 01:45:34,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,734 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-23 01:45:34,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:45:34,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,778 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,787 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-23 01:45:34,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-23 01:45:34,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,817 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,824 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-23 01:45:34,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-23 01:45:34,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,854 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-23 01:45:34,857 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-23 01:45:34,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,884 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:45:34,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-23 01:45:34,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,931 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-23 01:45:34,933 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-23 01:45:34,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,955 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-23 01:45:34,957 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-23 01:45:34,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:34,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:34,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:34,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:45:34,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:34,981 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:34,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-23 01:45:34,984 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-23 01:45:34,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:45:34,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:45:34,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:45:34,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:45:35,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:45:35,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:45:35,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-23 01:45:35,092 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-23 01:45:35,093 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-11-23 01:45:35,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:45:35,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:35,119 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:45:35,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-23 01:45:35,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-23 01:45:35,205 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-23 01:45:35,205 INFO L513 LassoAnalysis]: Proved termination. [2022-11-23 01:45:35,205 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-11-23 01:45:35,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-11-23 01:45:35,231 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-11-23 01:45:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:35,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 01:45:35,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:35,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 01:45:35,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:35,314 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-23 01:45:35,315 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-23 01:45:35,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:35,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 69 transitions. Complement of second has 5 states. [2022-11-23 01:45:35,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-23 01:45:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-11-23 01:45:35,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2022-11-23 01:45:35,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:35,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2022-11-23 01:45:35,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:35,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2022-11-23 01:45:35,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:45:35,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-11-23 01:45:35,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:35,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2022-11-23 01:45:35,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-23 01:45:35,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-23 01:45:35,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2022-11-23 01:45:35,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:35,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-23 01:45:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2022-11-23 01:45:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-23 01:45:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 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-23 01:45:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-23 01:45:35,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-23 01:45:35,336 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-23 01:45:35,336 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-23 01:45:35,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2022-11-23 01:45:35,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-23 01:45:35,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:45:35,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:45:35,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:45:35,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:45:35,337 INFO L748 eck$LassoCheckResult]: Stem: 3364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3373#L367 assume !(main_~length~0#1 < 1); 3366#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3367#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3368#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3374#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3402#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3375#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3376#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3377#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3380#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3401#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3400#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3398#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3396#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3394#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3392#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3390#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3388#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3387#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3382#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3383#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3381#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3369#L370-4 main_~j~0#1 := 0; 3370#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3405#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3406#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3403#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-23 01:45:35,337 INFO L750 eck$LassoCheckResult]: Loop: 3378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3379#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-23 01:45:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2022-11-23 01:45:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:35,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735443515] [2022-11-23 01:45:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:35,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:45:35,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735443515] [2022-11-23 01:45:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735443515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:45:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839239294] [2022-11-23 01:45:35,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 01:45:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:45:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:45:35,908 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:45:35,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-23 01:45:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:45:36,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 01:45:36,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:45:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 01:45:36,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 01:45:36,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 01:45:36,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 01:45:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:36,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 01:45:36,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:45:36,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 01:45:36,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 01:45:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:45:36,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:45:36,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-23 01:45:36,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-23 01:45:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 01:45:36,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839239294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:45:36,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:45:36,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2022-11-23 01:45:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901336584] [2022-11-23 01:45:36,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:45:36,743 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:45:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:45:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2022-11-23 01:45:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:45:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026743390] [2022-11-23 01:45:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:45:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:45:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:36,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:45:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:45:36,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:45:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:45:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 01:45:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-23 01:45:36,804 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:45:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:45:37,204 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-11-23 01:45:37,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-11-23 01:45:37,204 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-23 01:45:37,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-11-23 01:45:37,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-23 01:45:37,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-23 01:45:37,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-23 01:45:37,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:45:37,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 01:45:37,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 01:45:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 01:45:37,205 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 01:45:37,205 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-23 01:45:37,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-23 01:45:37,206 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-23 01:45:37,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-23 01:45:37,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:45:37 BoogieIcfgContainer [2022-11-23 01:45:37,213 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-23 01:45:37,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:45:37,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:45:37,215 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:45:37,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:14" (3/4) ... [2022-11-23 01:45:37,218 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 01:45:37,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:45:37,219 INFO L158 Benchmark]: Toolchain (without parser) took 23360.77ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 133.7MB in the beginning and 240.4MB in the end (delta: -106.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-11-23 01:45:37,219 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:45:37,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.28ms. Allocated memory is still 165.7MB. Free memory was 133.3MB in the beginning and 116.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 01:45:37,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:45:37,222 INFO L158 Benchmark]: Boogie Preprocessor took 21.69ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 113.3MB in the end (delta: 876.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:45:37,223 INFO L158 Benchmark]: RCFGBuilder took 381.71ms. Allocated memory is still 165.7MB. Free memory was 112.9MB in the beginning and 102.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 01:45:37,223 INFO L158 Benchmark]: BuchiAutomizer took 22455.49ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 102.5MB in the beginning and 240.4MB in the end (delta: -137.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:45:37,223 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 293.6MB. Free memory is still 240.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:45:37,225 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.31ms. Allocated memory is still 121.6MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.28ms. Allocated memory is still 165.7MB. Free memory was 133.3MB in the beginning and 116.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.69ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 113.3MB in the end (delta: 876.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.71ms. Allocated memory is still 165.7MB. Free memory was 112.9MB in the beginning and 102.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 22455.49ms. Allocated memory was 165.7MB in the beginning and 293.6MB in the end (delta: 127.9MB). Free memory was 102.5MB in the beginning and 240.4MB in the end (delta: -137.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 293.6MB. Free memory is still 240.4MB. 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 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[arr] + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr] + -1 * arr and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 16.6s. Construction of modules took 2.2s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 152 StatesRemovedByMinimization, 12 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2903 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 160 mSDtfsCounter, 2903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc12 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp93 ukn83 mio100 lsp58 div163 bol100 ite100 ukn100 eq150 hnf93 smp73 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-23 01:45:37,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:37,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-23 01:45:37,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-23 01:45:37,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-23 01:45:38,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-23 01:45:38,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-23 01:45:38,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-23 01:45:38,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-23 01:45:38,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-23 01:45:39,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-23 01:45:39,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-23 01:45:39,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:39,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 01:45:39,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-23 01:45:40,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81447084-e81d-4033-b75b-4d1c901236ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE