./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/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_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/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_f7daa01d-0379-4833-8805-bbb197cffa34/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 a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- 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 10:37:32,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:37:32,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:37:32,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:37:32,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:37:32,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:37:32,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:37:32,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:37:32,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:37:32,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:37:32,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:37:32,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:37:32,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:37:32,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:37:32,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:37:32,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:37:32,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:37:32,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:37:32,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:37:32,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:37:32,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:37:32,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:37:32,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:37:32,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:37:32,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:37:32,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:37:32,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:37:32,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:37:32,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:37:32,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:37:32,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:37:32,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:37:32,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:37:32,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:37:32,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:37:32,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:37:32,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:37:32,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:37:32,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:37:32,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:37:32,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:37:32,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-20 10:37:32,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:37:32,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:37:32,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:37:32,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:37:32,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:37:32,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:37:32,238 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:37:32,238 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:37:32,238 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:37:32,239 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:37:32,240 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:37:32,240 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:37:32,240 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:37:32,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:37:32,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:37:32,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:37:32,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:37:32,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:37:32,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:37:32,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:37:32,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:37:32,242 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:37:32,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:37:32,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:37:32,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:37:32,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:37:32,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:37:32,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:37:32,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:37:32,246 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_f7daa01d-0379-4833-8805-bbb197cffa34/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_f7daa01d-0379-4833-8805-bbb197cffa34/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 -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2022-11-20 10:37:32,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:37:32,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:37:32,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:37:32,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:37:32,565 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:37:32,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2022-11-20 10:37:35,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:37:35,955 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:37:35,956 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2022-11-20 10:37:35,963 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/data/e50b67dfb/82caf38936274b6286309d3acc14494f/FLAG80264a434 [2022-11-20 10:37:35,981 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/data/e50b67dfb/82caf38936274b6286309d3acc14494f [2022-11-20 10:37:35,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:37:35,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:37:35,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:35,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:37:35,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:37:35,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:35" (1/1) ... [2022-11-20 10:37:36,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd72466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36, skipping insertion in model container [2022-11-20 10:37:36,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:35" (1/1) ... [2022-11-20 10:37:36,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:37:36,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:37:36,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:36,178 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:37:36,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:36,213 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:37:36,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36 WrapperNode [2022-11-20 10:37:36,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:36,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:36,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:37:36,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:37:36,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,256 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-11-20 10:37:36,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:36,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:37:36,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:37:36,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:37:36,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:37:36,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:37:36,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:37:36,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:37:36,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (1/1) ... [2022-11-20 10:37:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:37:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:36,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:37:36,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:37:36,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:37:36,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:37:36,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:37:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:37:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:37:36,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:37:36,474 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:37:36,476 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:37:36,599 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:37:36,605 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:37:36,605 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:37:36,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:36 BoogieIcfgContainer [2022-11-20 10:37:36,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:37:36,609 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:37:36,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:37:36,613 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:37:36,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:37:36,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:37:35" (1/3) ... [2022-11-20 10:37:36,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46b1faa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:37:36, skipping insertion in model container [2022-11-20 10:37:36,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:37:36,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:36" (2/3) ... [2022-11-20 10:37:36,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46b1faa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:37:36, skipping insertion in model container [2022-11-20 10:37:36,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:37:36,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:36" (3/3) ... [2022-11-20 10:37:36,618 INFO L332 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2022-11-20 10:37:36,668 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:37:36,669 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:37:36,669 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:37:36,669 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:37:36,669 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:37:36,669 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:37:36,669 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:37:36,670 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:37:36,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 10:37:36,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-20 10:37:36,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:36,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:36,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:37:36,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:37:36,698 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:37:36,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 10:37:36,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-20 10:37:36,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:36,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:36,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:37:36,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:37:36,707 INFO L748 eck$LassoCheckResult]: Stem: 5#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~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 8#L13-3true [2022-11-20 10:37:36,707 INFO L750 eck$LassoCheckResult]: Loop: 8#L13-3true assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 7#L13-2true main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 8#L13-3true [2022-11-20 10:37:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 10:37:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:36,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369358656] [2022-11-20 10:37:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-20 10:37:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870587226] [2022-11-20 10:37:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-11-20 10:37:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44508738] [2022-11-20 10:37:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:36,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:37,321 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:37:37,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:37:37,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:37:37,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:37:37,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:37:37,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:37:37,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:37:37,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:37:37,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2022-11-20 10:37:37,324 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:37:37,324 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:37:37,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,509 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:37:37,673 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:37:37,678 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:37:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:37:37,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:37,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:37:37,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:37:37,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:37:37,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:37:37,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:37:37,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:37:37,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-20 10:37:37,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:37:37,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:37:37,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:37:37,807 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-20 10:37:37,807 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-11-20 10:37:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:37:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:37,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:37:37,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:37:37,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 10:37:37,935 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-20 10:37:37,935 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:37:37,936 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~n~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-11-20 10:37:37,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-20 10:37:37,979 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-11-20 10:37:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:38,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:37:38,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:38,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:37:38,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:38,141 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 10:37:38,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-20 10:37:38,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:38,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 37 transitions. Complement of second has 8 states. [2022-11-20 10:37:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 10:37:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-11-20 10:37:38,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2022-11-20 10:37:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:37:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-20 10:37:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:37:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-11-20 10:37:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:37:38,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. [2022-11-20 10:37:38,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:38,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2022-11-20 10:37:38,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-11-20 10:37:38,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-20 10:37:38,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-11-20 10:37:38,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:37:38,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-11-20 10:37:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-11-20 10:37:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-11-20 10:37:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 10:37:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-11-20 10:37:38,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-11-20 10:37:38,338 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-11-20 10:37:38,338 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:37:38,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-11-20 10:37:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:38,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:38,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:38,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-11-20 10:37:38,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:37:38,341 INFO L748 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 86#L13-3 assume !(main_~n~0#1 < 10); 80#L17-4 [2022-11-20 10:37:38,341 INFO L750 eck$LassoCheckResult]: Loop: 80#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 81#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 79#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 80#L17-4 [2022-11-20 10:37:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-11-20 10:37:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953760292] [2022-11-20 10:37:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:38,459 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 10:37:38,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:38,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953760292] [2022-11-20 10:37:38,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953760292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:38,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:38,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:37:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556145847] [2022-11-20 10:37:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:38,468 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:37:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2022-11-20 10:37:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145163268] [2022-11-20 10:37:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:38,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:38,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:38,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:37:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:38,673 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 10:37:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:38,688 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-11-20 10:37:38,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2022-11-20 10:37:38,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:38,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2022-11-20 10:37:38,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-11-20 10:37:38,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-11-20 10:37:38,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-11-20 10:37:38,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:37:38,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-11-20 10:37:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-11-20 10:37:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-11-20 10:37:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:37:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-11-20 10:37:38,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-11-20 10:37:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:37:38,694 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-11-20 10:37:38,694 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:37:38,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-11-20 10:37:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:38,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:38,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:38,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 10:37:38,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:37:38,696 INFO L748 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 109#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 107#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 108#L13-3 assume !(main_~n~0#1 < 10); 104#L17-4 [2022-11-20 10:37:38,697 INFO L750 eck$LassoCheckResult]: Loop: 104#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 102#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 103#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 104#L17-4 [2022-11-20 10:37:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-11-20 10:37:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:38,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060765201] [2022-11-20 10:37:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060765201] [2022-11-20 10:37:38,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060765201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098231435] [2022-11-20 10:37:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:38,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:38,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:37:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:38,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:37:38,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:38,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:38,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098231435] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:38,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:38,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-20 10:37:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929208822] [2022-11-20 10:37:38,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:38,859 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:37:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2022-11-20 10:37:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023289271] [2022-11-20 10:37:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:38,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:38,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:39,001 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:39,033 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-11-20 10:37:39,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2022-11-20 10:37:39,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:39,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2022-11-20 10:37:39,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-11-20 10:37:39,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-11-20 10:37:39,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-11-20 10:37:39,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:37:39,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 10:37:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-11-20 10:37:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 10:37:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-20 10:37:39,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 10:37:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:37:39,040 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 10:37:39,040 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:37:39,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-11-20 10:37:39,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:39,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:39,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:39,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-11-20 10:37:39,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:37:39,042 INFO L748 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 165#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 166#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 167#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 163#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 164#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 171#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 170#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 169#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 168#L13-3 assume !(main_~n~0#1 < 10); 160#L17-4 [2022-11-20 10:37:39,042 INFO L750 eck$LassoCheckResult]: Loop: 160#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 158#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 159#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 160#L17-4 [2022-11-20 10:37:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-11-20 10:37:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677888524] [2022-11-20 10:37:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:39,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:39,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677888524] [2022-11-20 10:37:39,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677888524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:39,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515102707] [2022-11-20 10:37:39,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:37:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:39,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:39,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:37:39,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:37:39,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:37:39,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:37:39,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:39,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:39,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515102707] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:39,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:39,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-20 10:37:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791699163] [2022-11-20 10:37:39,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:39,352 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:37:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2022-11-20 10:37:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630212406] [2022-11-20 10:37:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:37:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:37:39,478 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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 10:37:39,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-11-20 10:37:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:39,584 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-11-20 10:37:39,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2022-11-20 10:37:39,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:39,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2022-11-20 10:37:39,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-11-20 10:37:39,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-11-20 10:37:39,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-11-20 10:37:39,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:37:39,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-20 10:37:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-11-20 10:37:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-20 10:37:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-20 10:37:39,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-20 10:37:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:37:39,599 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-20 10:37:39,599 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 10:37:39,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-11-20 10:37:39,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-20 10:37:39,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:37:39,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:37:39,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-11-20 10:37:39,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:37:39,604 INFO L748 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 281#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 282#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 283#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 279#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 280#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 299#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 298#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 297#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 296#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 295#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 294#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 293#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 292#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 291#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 290#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 289#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 288#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 287#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 286#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 285#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 284#L13-3 assume !(main_~n~0#1 < 10); 276#L17-4 [2022-11-20 10:37:39,604 INFO L750 eck$LassoCheckResult]: Loop: 276#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 274#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 275#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 276#L17-4 [2022-11-20 10:37:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-11-20 10:37:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:39,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566763131] [2022-11-20 10:37:39,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2022-11-20 10:37:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:39,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960930001] [2022-11-20 10:37:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2022-11-20 10:37:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001026274] [2022-11-20 10:37:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:39,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:37:45,370 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 188 DAG size of output: 144 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:37:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:45,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:37:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:37:45,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:37:45 BoogieIcfgContainer [2022-11-20 10:37:45,818 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 10:37:45,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:37:45,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:37:45,819 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:37:45,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:36" (3/4) ... [2022-11-20 10:37:45,823 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-20 10:37:45,890 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:37:45,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:37:45,891 INFO L158 Benchmark]: Toolchain (without parser) took 9901.48ms. Allocated memory is still 161.5MB. Free memory was 132.0MB in the beginning and 56.9MB in the end (delta: 75.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,891 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:37:45,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.69ms. Allocated memory is still 161.5MB. Free memory was 132.0MB in the beginning and 122.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 161.5MB. Free memory was 122.4MB in the beginning and 120.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,894 INFO L158 Benchmark]: Boogie Preprocessor took 51.25ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 119.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:37:45,895 INFO L158 Benchmark]: RCFGBuilder took 298.50ms. Allocated memory is still 161.5MB. Free memory was 119.4MB in the beginning and 109.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,895 INFO L158 Benchmark]: BuchiAutomizer took 9209.11ms. Allocated memory is still 161.5MB. Free memory was 109.9MB in the beginning and 59.0MB in the end (delta: 50.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,896 INFO L158 Benchmark]: Witness Printer took 71.95ms. Allocated memory is still 161.5MB. Free memory was 59.0MB in the beginning and 56.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:37:45,898 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.28ms. Allocated memory is still 111.1MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.69ms. Allocated memory is still 161.5MB. Free memory was 132.0MB in the beginning and 122.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 161.5MB. Free memory was 122.4MB in the beginning and 120.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.25ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 119.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.50ms. Allocated memory is still 161.5MB. Free memory was 119.4MB in the beginning and 109.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9209.11ms. Allocated memory is still 161.5MB. Free memory was 109.9MB in the beginning and 59.0MB in the end (delta: 50.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 71.95ms. Allocated memory is still 161.5MB. Free memory was 59.0MB in the beginning and 56.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -8 * n + 19 * unknown-#length-unknown[a] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 8.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 26 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp65 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 256ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, n=10] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, n=10] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:37:45,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:46,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:46,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7daa01d-0379-4833-8805-bbb197cffa34/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)