./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN --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 e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- 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-6b4ec56 [2022-11-20 11:20:03,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:20:03,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:20:03,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:20:03,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:20:03,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:20:03,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:20:03,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:20:03,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:20:03,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:20:03,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:20:03,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:20:03,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:20:03,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:20:03,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:20:03,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:20:03,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:20:03,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:20:03,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:20:03,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:20:03,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:20:03,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:20:03,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:20:03,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:20:03,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:20:03,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:20:03,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:20:03,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:20:03,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:20:03,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:20:03,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:20:03,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:20:03,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:20:03,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:20:03,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:20:03,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:20:03,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:20:03,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:20:03,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:20:03,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:20:03,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:20:03,948 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-20 11:20:03,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:20:03,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:20:03,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:20:03,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:20:03,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:20:03,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:20:03,994 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:20:03,994 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 11:20:03,995 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 11:20:03,995 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 11:20:03,996 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 11:20:03,997 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 11:20:03,997 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 11:20:03,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:20:03,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:20:03,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:20:03,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:20:03,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 11:20:03,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 11:20:03,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 11:20:03,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:20:03,999 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 11:20:03,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:20:04,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 11:20:04,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:20:04,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:20:04,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:20:04,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:20:04,004 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 11:20:04,005 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_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/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_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN 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 -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2022-11-20 11:20:04,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:20:04,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:20:04,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:20:04,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:20:04,429 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:20:04,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-20 11:20:07,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:20:08,166 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:20:08,167 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-20 11:20:08,180 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/data/ccf2bcb83/a07532383a27494f8aba889e3efefbec/FLAG2668537f4 [2022-11-20 11:20:08,205 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/data/ccf2bcb83/a07532383a27494f8aba889e3efefbec [2022-11-20 11:20:08,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:20:08,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:20:08,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:20:08,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:20:08,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:20:08,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc3ba17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08, skipping insertion in model container [2022-11-20 11:20:08,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:20:08,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:20:08,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:20:08,627 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:20:08,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:20:08,748 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:20:08,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08 WrapperNode [2022-11-20 11:20:08,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:20:08,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:20:08,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:20:08,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:20:08,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,816 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-11-20 11:20:08,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:20:08,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:20:08,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:20:08,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:20:08,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:20:08,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:20:08,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:20:08,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:20:08,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (1/1) ... [2022-11-20 11:20:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:20:08,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:20:08,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 11:20:08,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 11:20:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:20:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:20:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:20:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:20:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:20:08,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:20:09,099 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:20:09,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:20:09,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:20:09,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:20:09,355 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:20:09,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:20:09 BoogieIcfgContainer [2022-11-20 11:20:09,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:20:09,359 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 11:20:09,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 11:20:09,364 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 11:20:09,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:20:09,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:20:08" (1/3) ... [2022-11-20 11:20:09,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40b007a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:20:09, skipping insertion in model container [2022-11-20 11:20:09,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:20:09,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:08" (2/3) ... [2022-11-20 11:20:09,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40b007a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:20:09, skipping insertion in model container [2022-11-20 11:20:09,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:20:09,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:20:09" (3/3) ... [2022-11-20 11:20:09,385 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-11-20 11:20:09,516 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 11:20:09,516 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 11:20:09,516 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 11:20:09,517 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 11:20:09,517 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 11:20:09,517 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 11:20:09,517 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 11:20:09,517 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 11:20:09,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:09,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 11:20:09,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:20:09,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:20:09,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:20:09,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 11:20:09,557 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 11:20:09,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:09,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 11:20:09,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:20:09,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:20:09,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:20:09,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 11:20:09,569 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 5#L552-4true [2022-11-20 11:20:09,570 INFO L750 eck$LassoCheckResult]: Loop: 5#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 11#L553-4true assume !true; 4#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 5#L552-4true [2022-11-20 11:20:09,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 11:20:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:09,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689696921] [2022-11-20 11:20:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:09,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:20:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:09,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:20:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-11-20 11:20:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149190474] [2022-11-20 11:20:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:10,122 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-20 11:20:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:10,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149190474] [2022-11-20 11:20:10,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149190474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:20:10,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:20:10,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:20:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411693633] [2022-11-20 11:20:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:20:10,132 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:20:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:20:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:20:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:20:10,192 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:20:10,203 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-20 11:20:10,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-11-20 11:20:10,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 11:20:10,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-11-20 11:20:10,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-20 11:20:10,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-11-20 11:20:10,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-11-20 11:20:10,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:20:10,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-20 11:20:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-11-20 11:20:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-20 11:20:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-20 11:20:10,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-20 11:20:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:20:10,271 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-20 11:20:10,271 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 11:20:10,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-11-20 11:20:10,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 11:20:10,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:20:10,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:20:10,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:20:10,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-20 11:20:10,275 INFO L748 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2022-11-20 11:20:10,276 INFO L750 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2022-11-20 11:20:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-20 11:20:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:10,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010774107] [2022-11-20 11:20:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:10,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:20:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:10,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:20:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-11-20 11:20:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:10,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513257290] [2022-11-20 11:20:10,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:10,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:10,532 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-20 11:20:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513257290] [2022-11-20 11:20:10,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513257290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:20:10,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:20:10,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:20:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265496827] [2022-11-20 11:20:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:20:10,534 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:20:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:20:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:20:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:20:10,536 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:20:10,610 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-11-20 11:20:10,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-11-20 11:20:10,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-20 11:20:10,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-11-20 11:20:10,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-20 11:20:10,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-20 11:20:10,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-11-20 11:20:10,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:20:10,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-20 11:20:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-11-20 11:20:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-11-20 11:20:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-20 11:20:10,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-20 11:20:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:20:10,619 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-20 11:20:10,619 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 11:20:10,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-11-20 11:20:10,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-20 11:20:10,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:20:10,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:20:10,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:20:10,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:20:10,624 INFO L748 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-4 [2022-11-20 11:20:10,624 INFO L750 eck$LassoCheckResult]: Loop: 61#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 64#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 65#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 66#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 69#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 60#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 61#L552-4 [2022-11-20 11:20:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-20 11:20:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:10,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814426728] [2022-11-20 11:20:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:10,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:20:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:10,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:20:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-11-20 11:20:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:10,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325531963] [2022-11-20 11:20:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:11,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325531963] [2022-11-20 11:20:11,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325531963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:11,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316777896] [2022-11-20 11:20:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:11,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:20:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:20:11,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:20:11,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:20:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:11,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:20:11,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:20:11,715 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-20 11:20:11,862 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-20 11:20:11,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-11-20 11:20:12,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 11:20:12,048 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-20 11:20:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:12,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:20:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:12,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316777896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:20:12,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:20:12,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-20 11:20:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540470088] [2022-11-20 11:20:12,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:20:12,184 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:20:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:20:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:20:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:20:12,185 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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-20 11:20:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:20:12,334 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-20 11:20:12,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-11-20 11:20:12,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-11-20 11:20:12,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-11-20 11:20:12,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-20 11:20:12,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-20 11:20:12,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-11-20 11:20:12,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:20:12,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-20 11:20:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-11-20 11:20:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-20 11:20:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:20:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-20 11:20:12,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-20 11:20:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:20:12,351 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-20 11:20:12,352 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 11:20:12,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-11-20 11:20:12,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-20 11:20:12,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:20:12,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:20:12,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:20:12,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-11-20 11:20:12,358 INFO L748 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2022-11-20 11:20:12,358 INFO L750 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 156#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 157#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 159#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 166#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 162#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 163#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 151#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 152#L552-4 [2022-11-20 11:20:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-20 11:20:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:12,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57650528] [2022-11-20 11:20:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:12,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:20:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:20:12,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:20:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-11-20 11:20:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655979388] [2022-11-20 11:20:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:15,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655979388] [2022-11-20 11:20:15,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655979388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:15,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766784545] [2022-11-20 11:20:15,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:20:15,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:20:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:20:15,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:20:15,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:20:15,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:20:15,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:20:15,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 11:20:15,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:20:15,264 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-20 11:20:15,351 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-20 11:20:15,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-11-20 11:20:15,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-20 11:20:15,560 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-20 11:20:15,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-20 11:20:15,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-20 11:20:15,815 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-20 11:20:15,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-20 11:20:15,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-20 11:20:16,104 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-20 11:20:16,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-20 11:20:16,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 11:20:16,233 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-20 11:20:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:16,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:33,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (v_ArrVal_225 Int) (v_ArrVal_236 Int) (v_ArrVal_207 Int) (v_ArrVal_217 Int) (v_ArrVal_228 Int) (|ULTIMATE.start_main_~c~0#1.offset| Int) (v_ArrVal_204 Int) (v_ArrVal_215 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse14 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse6 (select .cse13 |ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (store .cse13 |ULTIMATE.start_main_~c~0#1.base| (store .cse6 |ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_204)))) (let ((.cse2 (select .cse12 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_207 (- 1)))))) (let ((.cse7 (select .cse11 |ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (store .cse11 |ULTIMATE.start_main_~c~0#1.base| (store .cse7 |ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_215)))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_217 (- 1)))))) (let ((.cse3 (select .cse9 |ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store .cse9 |ULTIMATE.start_main_~c~0#1.base| (store .cse3 |ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_225)))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_228 (- 1)))))) (let ((.cse1 (select .cse0 |ULTIMATE.start_main_~c~0#1.base|))) (or (<= (select (select (store .cse0 |ULTIMATE.start_main_~c~0#1.base| (store .cse1 |ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_236)) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (not (<= v_ArrVal_207 (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))) (not (<= v_ArrVal_225 (+ (select .cse3 |ULTIMATE.start_main_~c~0#1.offset|) 1))) (not (<= v_ArrVal_217 (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))) (not (<= v_ArrVal_228 (+ 2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (not (<= v_ArrVal_204 (+ (select .cse6 |ULTIMATE.start_main_~c~0#1.offset|) 1))) (not (<= v_ArrVal_236 (+ (select .cse1 |ULTIMATE.start_main_~c~0#1.offset|) 1))) (not (<= v_ArrVal_215 (+ (select .cse7 |ULTIMATE.start_main_~c~0#1.offset|) 1))))))))))))))))))) is different from false [2022-11-20 11:24:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-20 11:24:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766784545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:33,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:24:33,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 22 [2022-11-20 11:24:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130705389] [2022-11-20 11:24:33,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:33,468 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:24:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:33,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:24:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=257, Unknown=16, NotChecked=38, Total=462 [2022-11-20 11:24:33,470 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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-20 11:24:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:33,954 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-11-20 11:24:33,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-11-20 11:24:33,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-11-20 11:24:33,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2022-11-20 11:24:33,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-20 11:24:33,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-20 11:24:33,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2022-11-20 11:24:33,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:24:33,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-20 11:24:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2022-11-20 11:24:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-11-20 11:24:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 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-20 11:24:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-20 11:24:33,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-20 11:24:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:24:33,961 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-20 11:24:33,961 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 11:24:33,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-11-20 11:24:33,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-11-20 11:24:33,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:24:33,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:24:33,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:24:33,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2022-11-20 11:24:33,964 INFO L748 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 323#L552-4 [2022-11-20 11:24:33,964 INFO L750 eck$LassoCheckResult]: Loop: 323#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 324#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 329#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 341#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 325#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 326#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 327#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 328#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 340#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 339#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 338#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 337#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 336#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 335#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 334#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 333#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 331#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 332#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 330#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 322#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 323#L552-4 [2022-11-20 11:24:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-20 11:24:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:33,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846360213] [2022-11-20 11:24:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:33,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:24:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:33,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:24:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 3 times [2022-11-20 11:24:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567760312] [2022-11-20 11:24:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:34,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:24:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:24:34,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:24:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2022-11-20 11:24:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047183015] [2022-11-20 11:24:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:24:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:35,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047183015] [2022-11-20 11:24:35,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047183015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:35,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529856098] [2022-11-20 11:24:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:35,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:24:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:35,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:24:35,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:24:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:35,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-20 11:24:35,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:35,887 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 44 treesize of output 42 [2022-11-20 11:24:35,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:24:35,937 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-20 11:24:35,943 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 14 treesize of output 16 [2022-11-20 11:24:35,962 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 16 [2022-11-20 11:24:35,988 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-20 11:24:35,995 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 14 treesize of output 16 [2022-11-20 11:24:36,034 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 16 [2022-11-20 11:24:36,075 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-20 11:24:36,082 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 14 treesize of output 16 [2022-11-20 11:24:36,111 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 16 [2022-11-20 11:24:36,142 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-20 11:24:36,150 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 14 treesize of output 16 [2022-11-20 11:24:36,172 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 16 [2022-11-20 11:24:36,199 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-20 11:24:36,207 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 14 treesize of output 16 [2022-11-20 11:24:36,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 11:24:36,247 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-20 11:24:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:24:36,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:00,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (not (<= (+ v_ArrVal_470 1) (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|))))))))) is different from false [2022-11-20 11:25:00,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|))))))))) is different from false [2022-11-20 11:25:00,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (not (<= (+ v_ArrVal_465 1) (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|)))))))))) is different from false [2022-11-20 11:25:00,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_465) (not (<= v_ArrVal_471 (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470)))))))) is different from false [2022-11-20 11:26:37,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse8 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (not (<= v_ArrVal_456 (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))))))))))))) is different from false [2022-11-20 11:26:37,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:37,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 767 treesize of output 467 [2022-11-20 11:26:37,934 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 902 treesize of output 894 [2022-11-20 11:26:37,959 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 50 treesize of output 46 [2022-11-20 11:26:37,983 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 118 treesize of output 110 [2022-11-20 11:26:38,008 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 262 treesize of output 246 [2022-11-20 11:26:38,033 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 22 [2022-11-20 11:26:38,057 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 438 treesize of output 406 [2022-11-20 11:26:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-20 11:26:38,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529856098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:26:38,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:26:38,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 28 [2022-11-20 11:26:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487038274] [2022-11-20 11:26:38,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:55,698 WARN L233 SmtUtils]: Spent 17.51s on a formula simplification. DAG size of input: 169 DAG size of output: 158 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:26:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:26:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=306, Unknown=20, NotChecked=230, Total=756 [2022-11-20 11:26:59,060 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:27:29,096 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 73 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:27:42,355 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 85 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:28:35,971 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:29:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:15,008 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-11-20 11:29:15,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2022-11-20 11:29:15,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2022-11-20 11:29:15,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2022-11-20 11:29:15,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-20 11:29:15,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-20 11:29:15,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2022-11-20 11:29:15,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:29:15,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-11-20 11:29:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2022-11-20 11:29:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-20 11:29:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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-20 11:29:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-11-20 11:29:15,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-20 11:29:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 11:29:15,016 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-20 11:29:15,017 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 11:29:15,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2022-11-20 11:29:15,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-20 11:29:15,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:29:15,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:29:15,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 11:29:15,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2022-11-20 11:29:15,019 INFO L748 eck$LassoCheckResult]: Stem: 571#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 574#L552-4 [2022-11-20 11:29:15,019 INFO L750 eck$LassoCheckResult]: Loop: 574#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 575#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 579#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 578#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 576#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 577#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 604#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 603#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 602#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 601#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 600#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 599#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 598#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 597#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 596#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 595#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 594#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 593#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 592#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 591#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 590#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 589#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 588#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 587#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 586#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 585#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 584#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 583#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 581#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 582#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 580#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 573#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 574#L552-4 [2022-11-20 11:29:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-20 11:29:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015924387] [2022-11-20 11:29:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:29:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:29:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 4 times [2022-11-20 11:29:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:15,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602174176] [2022-11-20 11:29:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:29:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:29:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 2 times [2022-11-20 11:29:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:15,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690256748] [2022-11-20 11:29:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:29:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:29:15,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:30:42,240 WARN L233 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 257 DAG size of output: 247 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:30:52,807 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:30:53,411 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 11:30:53,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 11:30:53,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 11:30:53,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 11:30:53,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 11:30:53,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:30:53,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 11:30:53,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 11:30:53,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso [2022-11-20 11:30:53,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 11:30:53,413 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 11:30:53,422 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.base/java.lang.Math.toIntExact(Math.java:1074) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:551) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:615) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 11:30:53,432 INFO L158 Benchmark]: Toolchain (without parser) took 645213.44ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 136.5MB in the beginning and 148.5MB in the end (delta: -12.1MB). Peak memory consumption was 158.7MB. Max. memory is 16.1GB. [2022-11-20 11:30:53,433 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:30:53,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.09ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 120.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 11:30:53,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:30:53,434 INFO L158 Benchmark]: Boogie Preprocessor took 42.39ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:30:53,436 INFO L158 Benchmark]: RCFGBuilder took 496.25ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 106.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:30:53,436 INFO L158 Benchmark]: BuchiAutomizer took 644067.68ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 106.1MB in the beginning and 148.5MB in the end (delta: -42.4MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2022-11-20 11:30:53,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.09ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 120.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.39ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 496.25ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 106.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 644067.68ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 106.1MB in the beginning and 148.5MB in the end (delta: -42.4MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.base/java.lang.Math.toIntExact(Math.java:1074) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-20 11:30:53,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:53,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:53,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:54,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66b26f50-655d-4d47-b7a7-aacc9d692a8e/bin/uautomizer-ug76WZFUDN/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow