./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7fb0cb3aecdc56f56ac37bccb90dc5beea8d3d2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 21:11:42,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 21:11:42,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 21:11:42,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 21:11:42,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 21:11:42,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 21:11:42,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 21:11:42,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 21:11:42,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 21:11:42,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 21:11:42,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 21:11:42,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 21:11:42,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 21:11:42,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 21:11:42,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 21:11:42,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 21:11:42,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 21:11:42,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 21:11:42,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 21:11:42,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 21:11:42,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 21:11:42,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 21:11:42,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 21:11:42,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 21:11:42,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 21:11:42,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 21:11:42,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 21:11:42,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 21:11:42,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 21:11:42,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 21:11:42,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 21:11:42,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 21:11:42,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 21:11:42,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 21:11:42,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 21:11:42,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 21:11:42,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 21:11:42,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 21:11:42,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 21:11:42,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 21:11:42,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 21:11:42,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 21:11:42,470 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 21:11:42,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 21:11:42,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 21:11:42,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 21:11:42,472 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 21:11:42,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 21:11:42,473 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 21:11:42,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 21:11:42,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 21:11:42,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 21:11:42,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 21:11:42,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 21:11:42,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 21:11:42,474 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 21:11:42,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 21:11:42,475 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 21:11:42,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 21:11:42,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 21:11:42,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 21:11:42,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 21:11:42,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 21:11:42,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 21:11:42,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 21:11:42,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 21:11:42,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 21:11:42,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 21:11:42,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 21:11:42,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 21:11:42,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 21:11:42,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/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-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7fb0cb3aecdc56f56ac37bccb90dc5beea8d3d2 [2020-11-29 21:11:42,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 21:11:42,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 21:11:42,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 21:11:42,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 21:11:42,774 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 21:11:42,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/../../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2020-11-29 21:11:42,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/data/316b2c871/3ae07f120a1e43ffa8bd635fd652b676/FLAG985348e25 [2020-11-29 21:11:43,311 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 21:11:43,311 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2020-11-29 21:11:43,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/data/316b2c871/3ae07f120a1e43ffa8bd635fd652b676/FLAG985348e25 [2020-11-29 21:11:43,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/data/316b2c871/3ae07f120a1e43ffa8bd635fd652b676 [2020-11-29 21:11:43,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 21:11:43,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 21:11:43,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 21:11:43,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 21:11:43,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 21:11:43,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:43,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a00071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43, skipping insertion in model container [2020-11-29 21:11:43,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:43,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 21:11:43,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 21:11:43,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:11:43,963 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 21:11:43,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:11:43,995 INFO L208 MainTranslator]: Completed translation [2020-11-29 21:11:43,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43 WrapperNode [2020-11-29 21:11:43,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 21:11:43,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 21:11:43,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 21:11:43,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 21:11:44,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 21:11:44,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 21:11:44,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 21:11:44,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 21:11:44,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... [2020-11-29 21:11:44,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 21:11:44,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 21:11:44,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 21:11:44,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 21:11:44,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 21:11:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 21:11:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 21:11:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 21:11:44,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 21:11:44,468 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 21:11:44,475 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-29 21:11:44,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:11:44 BoogieIcfgContainer [2020-11-29 21:11:44,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 21:11:44,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 21:11:44,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 21:11:44,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 21:11:44,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:11:43" (1/3) ... [2020-11-29 21:11:44,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226f5795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:11:44, skipping insertion in model container [2020-11-29 21:11:44,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:11:43" (2/3) ... [2020-11-29 21:11:44,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226f5795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:11:44, skipping insertion in model container [2020-11-29 21:11:44,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:11:44" (3/3) ... [2020-11-29 21:11:44,485 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2020-11-29 21:11:44,495 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 21:11:44,499 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-11-29 21:11:44,511 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 21:11:44,539 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 21:11:44,539 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 21:11:44,540 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 21:11:44,540 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 21:11:44,540 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 21:11:44,540 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 21:11:44,540 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 21:11:44,540 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 21:11:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-29 21:11:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 21:11:44,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:44,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:44,560 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2020-11-29 21:11:44,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:44,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905294467] [2020-11-29 21:11:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:44,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905294467] [2020-11-29 21:11:44,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:44,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 21:11:44,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695894208] [2020-11-29 21:11:44,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 21:11:44,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 21:11:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 21:11:44,714 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2020-11-29 21:11:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:44,732 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2020-11-29 21:11:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 21:11:44,733 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-11-29 21:11:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:44,741 INFO L225 Difference]: With dead ends: 75 [2020-11-29 21:11:44,742 INFO L226 Difference]: Without dead ends: 35 [2020-11-29 21:11:44,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 21:11:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-29 21:11:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-29 21:11:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 21:11:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-11-29 21:11:44,777 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2020-11-29 21:11:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:44,778 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-11-29 21:11:44,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 21:11:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-11-29 21:11:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 21:11:44,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:44,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:44,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 21:11:44,779 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2020-11-29 21:11:44,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:44,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726025677] [2020-11-29 21:11:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:44,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726025677] [2020-11-29 21:11:44,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:44,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:11:44,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173767928] [2020-11-29 21:11:44,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:11:44,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:11:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:11:44,878 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 4 states. [2020-11-29 21:11:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:45,027 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-11-29 21:11:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:11:45,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-29 21:11:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:45,028 INFO L225 Difference]: With dead ends: 54 [2020-11-29 21:11:45,029 INFO L226 Difference]: Without dead ends: 52 [2020-11-29 21:11:45,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:11:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-29 21:11:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2020-11-29 21:11:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-29 21:11:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-11-29 21:11:45,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 7 [2020-11-29 21:11:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:45,037 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-29 21:11:45,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:11:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-11-29 21:11:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 21:11:45,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:45,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:45,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 21:11:45,039 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1186818322, now seen corresponding path program 1 times [2020-11-29 21:11:45,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:45,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520795887] [2020-11-29 21:11:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:45,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520795887] [2020-11-29 21:11:45,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:45,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:11:45,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523007957] [2020-11-29 21:11:45,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:11:45,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:11:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:11:45,116 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2020-11-29 21:11:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:45,236 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-11-29 21:11:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:11:45,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-29 21:11:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:45,238 INFO L225 Difference]: With dead ends: 52 [2020-11-29 21:11:45,239 INFO L226 Difference]: Without dead ends: 50 [2020-11-29 21:11:45,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:11:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-29 21:11:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2020-11-29 21:11:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 21:11:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-11-29 21:11:45,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2020-11-29 21:11:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:45,249 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-11-29 21:11:45,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:11:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-11-29 21:11:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 21:11:45,250 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:45,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:45,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 21:11:45,251 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1928706379, now seen corresponding path program 1 times [2020-11-29 21:11:45,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:45,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144162093] [2020-11-29 21:11:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:45,267 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:45,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858857868] [2020-11-29 21:11:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:45,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 21:11:45,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:45,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144162093] [2020-11-29 21:11:45,425 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:45,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858857868] [2020-11-29 21:11:45,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:45,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:11:45,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364489410] [2020-11-29 21:11:45,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:11:45,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:11:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:11:45,427 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-11-29 21:11:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:45,581 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-11-29 21:11:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:11:45,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 21:11:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:45,585 INFO L225 Difference]: With dead ends: 72 [2020-11-29 21:11:45,586 INFO L226 Difference]: Without dead ends: 50 [2020-11-29 21:11:45,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:11:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-29 21:11:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-11-29 21:11:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-29 21:11:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-29 21:11:45,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2020-11-29 21:11:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:45,603 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-29 21:11:45,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:11:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-11-29 21:11:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 21:11:45,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:45,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:45,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:45,805 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash -13373041, now seen corresponding path program 1 times [2020-11-29 21:11:45,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:45,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872644425] [2020-11-29 21:11:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:45,820 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:45,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007659082] [2020-11-29 21:11:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:45,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 21:11:45,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:45,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872644425] [2020-11-29 21:11:45,950 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:45,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007659082] [2020-11-29 21:11:45,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:45,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:11:45,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525858611] [2020-11-29 21:11:45,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:11:45,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:11:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:11:45,952 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2020-11-29 21:11:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:46,062 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2020-11-29 21:11:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 21:11:46,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 21:11:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:46,065 INFO L225 Difference]: With dead ends: 63 [2020-11-29 21:11:46,065 INFO L226 Difference]: Without dead ends: 52 [2020-11-29 21:11:46,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:11:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-29 21:11:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2020-11-29 21:11:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-29 21:11:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-11-29 21:11:46,080 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 14 [2020-11-29 21:11:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:46,080 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-11-29 21:11:46,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:11:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-11-29 21:11:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 21:11:46,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:46,081 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:46,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:46,283 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1886608768, now seen corresponding path program 1 times [2020-11-29 21:11:46,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:46,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813702189] [2020-11-29 21:11:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:46,293 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:46,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186555291] [2020-11-29 21:11:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:46,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 21:11:46,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:46,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813702189] [2020-11-29 21:11:46,393 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:46,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186555291] [2020-11-29 21:11:46,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:46,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-29 21:11:46,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346635927] [2020-11-29 21:11:46,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 21:11:46,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 21:11:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:11:46,395 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 5 states. [2020-11-29 21:11:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:46,574 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2020-11-29 21:11:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 21:11:46,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-29 21:11:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:46,577 INFO L225 Difference]: With dead ends: 108 [2020-11-29 21:11:46,577 INFO L226 Difference]: Without dead ends: 71 [2020-11-29 21:11:46,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 21:11:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-29 21:11:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2020-11-29 21:11:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-29 21:11:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-11-29 21:11:46,597 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 18 [2020-11-29 21:11:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:46,597 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-11-29 21:11:46,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 21:11:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-11-29 21:11:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 21:11:46,599 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:46,599 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:46,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:46,827 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1314135125, now seen corresponding path program 2 times [2020-11-29 21:11:46,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:46,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095671441] [2020-11-29 21:11:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:46,851 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:46,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454844565] [2020-11-29 21:11:46,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:46,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 21:11:46,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 21:11:46,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 21:11:46,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:46,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095671441] [2020-11-29 21:11:46,988 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:46,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454844565] [2020-11-29 21:11:46,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:46,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-29 21:11:46,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056741229] [2020-11-29 21:11:46,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 21:11:46,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 21:11:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:11:46,991 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2020-11-29 21:11:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:47,217 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2020-11-29 21:11:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 21:11:47,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-29 21:11:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:47,219 INFO L225 Difference]: With dead ends: 142 [2020-11-29 21:11:47,219 INFO L226 Difference]: Without dead ends: 105 [2020-11-29 21:11:47,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-29 21:11:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-29 21:11:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2020-11-29 21:11:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-29 21:11:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-11-29 21:11:47,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 25 [2020-11-29 21:11:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:47,232 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-11-29 21:11:47,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 21:11:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-11-29 21:11:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 21:11:47,233 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:47,233 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:47,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:47,447 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1085203663, now seen corresponding path program 1 times [2020-11-29 21:11:47,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:47,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839173950] [2020-11-29 21:11:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:47,461 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:47,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756084710] [2020-11-29 21:11:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:47,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-29 21:11:47,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:47,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839173950] [2020-11-29 21:11:47,653 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:47,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756084710] [2020-11-29 21:11:47,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:47,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-29 21:11:47,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988666469] [2020-11-29 21:11:47,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 21:11:47,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 21:11:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:11:47,655 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2020-11-29 21:11:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:47,893 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2020-11-29 21:11:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 21:11:47,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-29 21:11:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:47,894 INFO L225 Difference]: With dead ends: 102 [2020-11-29 21:11:47,894 INFO L226 Difference]: Without dead ends: 100 [2020-11-29 21:11:47,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-29 21:11:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-29 21:11:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2020-11-29 21:11:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 21:11:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2020-11-29 21:11:47,906 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 27 [2020-11-29 21:11:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:47,907 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2020-11-29 21:11:47,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 21:11:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2020-11-29 21:11:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 21:11:47,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:47,908 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:48,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:48,109 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:48,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1129109896, now seen corresponding path program 1 times [2020-11-29 21:11:48,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:48,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819220379] [2020-11-29 21:11:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:48,122 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:48,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646533177] [2020-11-29 21:11:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:48,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 21:11:48,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:48,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819220379] [2020-11-29 21:11:48,312 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:48,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646533177] [2020-11-29 21:11:48,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:48,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-29 21:11:48,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947798705] [2020-11-29 21:11:48,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 21:11:48,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 21:11:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 21:11:48,317 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 7 states. [2020-11-29 21:11:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:48,581 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-11-29 21:11:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 21:11:48,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-11-29 21:11:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:48,584 INFO L225 Difference]: With dead ends: 100 [2020-11-29 21:11:48,584 INFO L226 Difference]: Without dead ends: 85 [2020-11-29 21:11:48,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-29 21:11:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-29 21:11:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-11-29 21:11:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-29 21:11:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2020-11-29 21:11:48,605 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 32 [2020-11-29 21:11:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:48,605 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2020-11-29 21:11:48,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 21:11:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2020-11-29 21:11:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 21:11:48,607 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:48,608 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:48,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:48,823 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1575226400, now seen corresponding path program 3 times [2020-11-29 21:11:48,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:48,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534892535] [2020-11-29 21:11:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:48,833 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:48,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419221447] [2020-11-29 21:11:48,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:48,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-29 21:11:48,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 21:11:48,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 21:11:48,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:48,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-29 21:11:48,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:11:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 21:11:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534892535] [2020-11-29 21:11:49,020 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419221447] [2020-11-29 21:11:49,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:49,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-29 21:11:49,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463689918] [2020-11-29 21:11:49,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 21:11:49,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 21:11:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 21:11:49,022 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 7 states. [2020-11-29 21:11:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:49,297 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2020-11-29 21:11:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 21:11:49,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-11-29 21:11:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:49,299 INFO L225 Difference]: With dead ends: 96 [2020-11-29 21:11:49,299 INFO L226 Difference]: Without dead ends: 86 [2020-11-29 21:11:49,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 21:11:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-29 21:11:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-11-29 21:11:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-29 21:11:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-11-29 21:11:49,314 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 32 [2020-11-29 21:11:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:49,315 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-11-29 21:11:49,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 21:11:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-11-29 21:11:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 21:11:49,320 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:49,320 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:49,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-29 21:11:49,534 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1042348646, now seen corresponding path program 2 times [2020-11-29 21:11:49,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:49,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115261606] [2020-11-29 21:11:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:49,553 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:49,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696454905] [2020-11-29 21:11:49,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:49,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 21:11:49,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 21:11:49,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-29 21:11:49,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:49,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115261606] [2020-11-29 21:11:49,736 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:49,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696454905] [2020-11-29 21:11:49,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:49,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-29 21:11:49,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474501617] [2020-11-29 21:11:49,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 21:11:49,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 21:11:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 21:11:49,738 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 7 states. [2020-11-29 21:11:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:50,090 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2020-11-29 21:11:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 21:11:50,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-11-29 21:11:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:50,091 INFO L225 Difference]: With dead ends: 99 [2020-11-29 21:11:50,091 INFO L226 Difference]: Without dead ends: 97 [2020-11-29 21:11:50,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 21:11:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-29 21:11:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2020-11-29 21:11:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-29 21:11:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2020-11-29 21:11:50,129 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 34 [2020-11-29 21:11:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:50,131 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2020-11-29 21:11:50,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 21:11:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2020-11-29 21:11:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 21:11:50,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:50,137 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:50,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-29 21:11:50,355 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1894983429, now seen corresponding path program 3 times [2020-11-29 21:11:50,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:50,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572137358] [2020-11-29 21:11:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:50,364 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:50,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186613171] [2020-11-29 21:11:50,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:50,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-29 21:11:50,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 21:11:50,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 21:11:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:50,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 21:11:50,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:11:50,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:11:50,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:11:50,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:11:51,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:11:51,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 21:11:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:51,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572137358] [2020-11-29 21:11:51,256 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:51,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186613171] [2020-11-29 21:11:51,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:51,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-29 21:11:51,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754895014] [2020-11-29 21:11:51,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 21:11:51,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 21:11:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-29 21:11:51,259 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 9 states. [2020-11-29 21:11:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:51,826 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2020-11-29 21:11:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 21:11:51,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-11-29 21:11:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:51,828 INFO L225 Difference]: With dead ends: 106 [2020-11-29 21:11:51,828 INFO L226 Difference]: Without dead ends: 63 [2020-11-29 21:11:51,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-11-29 21:11:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-29 21:11:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-11-29 21:11:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-29 21:11:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-11-29 21:11:51,838 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 40 [2020-11-29 21:11:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:51,839 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-11-29 21:11:51,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 21:11:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-11-29 21:11:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 21:11:51,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:51,840 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:52,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:52,067 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1501956419, now seen corresponding path program 1 times [2020-11-29 21:11:52,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:52,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946218370] [2020-11-29 21:11:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:52,075 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:52,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385685767] [2020-11-29 21:11:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:52,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 21:11:52,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 21:11:52,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946218370] [2020-11-29 21:11:52,238 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:52,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385685767] [2020-11-29 21:11:52,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:11:52,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 21:11:52,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413859074] [2020-11-29 21:11:52,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 21:11:52,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:52,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 21:11:52,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:11:52,239 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 6 states. [2020-11-29 21:11:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:52,375 INFO L93 Difference]: Finished difference Result 63 states and 62 transitions. [2020-11-29 21:11:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 21:11:52,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-11-29 21:11:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:52,376 INFO L225 Difference]: With dead ends: 63 [2020-11-29 21:11:52,376 INFO L226 Difference]: Without dead ends: 46 [2020-11-29 21:11:52,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 21:11:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-11-29 21:11:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-11-29 21:11:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-29 21:11:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2020-11-29 21:11:52,384 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 40 [2020-11-29 21:11:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:52,384 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2020-11-29 21:11:52,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 21:11:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2020-11-29 21:11:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-29 21:11:52,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:11:52,385 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:11:52,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:52,586 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:11:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:11:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 997635076, now seen corresponding path program 1 times [2020-11-29 21:11:52,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:11:52,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588592930] [2020-11-29 21:11:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:11:52,595 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 21:11:52,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760808615] [2020-11-29 21:11:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 21:11:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:11:52,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-29 21:11:52,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 21:11:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:11:52,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588592930] [2020-11-29 21:11:52,933 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 21:11:52,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760808615] [2020-11-29 21:11:52,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 21:11:52,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-29 21:11:52,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904289464] [2020-11-29 21:11:52,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 21:11:52,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:11:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 21:11:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-29 21:11:52,935 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 11 states. [2020-11-29 21:11:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:11:53,268 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2020-11-29 21:11:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 21:11:53,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-29 21:11:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:11:53,269 INFO L225 Difference]: With dead ends: 46 [2020-11-29 21:11:53,269 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 21:11:53,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-29 21:11:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 21:11:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 21:11:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 21:11:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 21:11:53,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-11-29 21:11:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:11:53,271 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 21:11:53,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 21:11:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 21:11:53,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 21:11:53,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-29 21:11:53,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 21:11:53,908 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-11-29 21:11:54,160 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-11-29 21:11:54,636 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 61 [2020-11-29 21:11:54,849 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-11-29 21:11:55,216 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 68 [2020-11-29 21:11:55,456 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-11-29 21:11:55,465 INFO L277 CegarLoopResult]: At program point L60(lines 22 61) the Hoare annotation is: true [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point L52(lines 52 55) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point L52-2(lines 22 61) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point L44-1(lines 44 56) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 21:11:55,465 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L270 CegarLoopResult]: At program point L15-1(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~A~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0)) (.cse5 (<= ULTIMATE.start_main_~A~0 2))) (or (and .cse0 (= ULTIMATE.start_main_~d~0 2) .cse1 (= ULTIMATE.start_main_~p~0 2) .cse2 .cse3 .cse4 .cse5 (= (* ULTIMATE.start_main_~B~0 2) ULTIMATE.start_main_~d~0)) (and (= ULTIMATE.start_main_~p~0 4) (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~B~0 4)) (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse1 .cse2 .cse3 .cse4 .cse5 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and .cse0 .cse1 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~p~0 1) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~d~0 1)))) [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L270 CegarLoopResult]: At program point L15-3(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~A~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0)) (.cse5 (<= ULTIMATE.start_main_~A~0 2))) (or (and .cse0 (= ULTIMATE.start_main_~d~0 2) .cse1 (= ULTIMATE.start_main_~p~0 2) .cse2 .cse3 .cse4 .cse5 (= (* ULTIMATE.start_main_~B~0 2) ULTIMATE.start_main_~d~0)) (and (= ULTIMATE.start_main_~p~0 4) (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~B~0 4)) (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse1 .cse2 .cse3 .cse4 .cse5 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and .cse0 .cse1 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~p~0 1) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~d~0 1)))) [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point L15-4(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,466 INFO L270 CegarLoopResult]: At program point L15-5(line 38) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~B~0))) (.cse0 (<= 0 ULTIMATE.start_main_~A~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0)) (.cse6 (<= ULTIMATE.start_main_~A~0 2))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~d~0 1)) (and (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~B~0 4)) .cse1 .cse2 (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse3 .cse4 .cse5 .cse6 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and .cse0 (= ULTIMATE.start_main_~d~0 2) .cse2 (= ULTIMATE.start_main_~p~0 2) .cse3 .cse4 .cse5 .cse6 (= (* ULTIMATE.start_main_~B~0 2) ULTIMATE.start_main_~d~0)))) [2020-11-29 21:11:55,466 INFO L274 CegarLoopResult]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,467 INFO L270 CegarLoopResult]: At program point L15-7(lines 14 20) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse5 (= ULTIMATE.start_main_~d~0 1)) (.cse6 (= ULTIMATE.start_main_~d~0 2)) (.cse1 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~r~0))) (.cse11 (<= 2 ULTIMATE.start_main_~A~0)) (.cse4 (= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0)) (.cse8 (= ULTIMATE.start_main_~p~0 2)) (.cse2 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0)) (.cse3 (= ULTIMATE.start_main_~p~0 1)) (.cse7 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (= ULTIMATE.start_main_~q~0 0)) (.cse12 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse10 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0)) (.cse13 (<= ULTIMATE.start_main_~A~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 (= (* ULTIMATE.start_main_~B~0 2) ULTIMATE.start_main_~d~0)) (and .cse0 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~q~0 2) .cse2 .cse11 .cse3 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~r~0 2)) .cse12 .cse5) (and (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~B~0)) .cse6 .cse1 .cse7 .cse11 .cse4 .cse8 .cse12 .cse13) (and (= ULTIMATE.start_main_~B~0 1) .cse7 .cse2 .cse3 .cse9 .cse10) (and (= ULTIMATE.start_main_~p~0 4) (= ULTIMATE.start_main_~d~0 (* (* (div (* ULTIMATE.start_main_~p~0 (- 1)) (- 2)) ULTIMATE.start_main_~B~0) 2)) (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse7 .cse9 .cse12 .cse10 .cse13 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)))) [2020-11-29 21:11:55,467 INFO L274 CegarLoopResult]: For program point L15-8(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,467 INFO L270 CegarLoopResult]: At program point L15-9(line 48) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse4 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (= ULTIMATE.start_main_~B~0 1)) (.cse6 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0)) (.cse7 (= ULTIMATE.start_main_~p~0 1)) (.cse8 (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~B~0))) (.cse0 (= ULTIMATE.start_main_~d~0 2)) (.cse9 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse12 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~r~0))) (.cse14 (<= 2 ULTIMATE.start_main_~A~0)) (.cse13 (= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0)) (.cse2 (= ULTIMATE.start_main_~p~0 2)) (.cse10 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse11 (<= ULTIMATE.start_main_~A~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (* ULTIMATE.start_main_~B~0 2) ULTIMATE.start_main_~d~0)) (and .cse5 .cse1 .cse6 .cse7 .cse3 .cse4) (and (= ULTIMATE.start_main_~p~0 4) .cse8 .cse9 (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse3 .cse10 .cse4 .cse11 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and .cse12 .cse1 .cse6 .cse13 .cse7 (= ULTIMATE.start_main_~d~0 1)) (and .cse5 (= ULTIMATE.start_main_~q~0 2) .cse9 .cse14 .cse6 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~r~0 2)) .cse7 .cse10 .cse11) (and .cse8 .cse0 .cse9 .cse12 .cse14 .cse13 .cse2 .cse10 .cse11))) [2020-11-29 21:11:55,467 INFO L274 CegarLoopResult]: For program point L15-10(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,467 INFO L270 CegarLoopResult]: At program point L15-11(lines 14 20) the Hoare annotation is: (and (= ULTIMATE.start_main_~B~0 1) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~p~0 1)) [2020-11-29 21:11:55,467 INFO L274 CegarLoopResult]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2020-11-29 21:11:55,467 INFO L277 CegarLoopResult]: At program point L15-13(lines 14 20) the Hoare annotation is: true [2020-11-29 21:11:55,467 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 21:11:55,468 INFO L270 CegarLoopResult]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~B~0))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (<= 0 ULTIMATE.start_main_~A~0)) (.cse2 (= ULTIMATE.start_main_~q~0 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (<= ULTIMATE.start_main_~A~0 2)) (.cse4 (= ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0))) (or (and (= ULTIMATE.start_main_~p~0 4) .cse0 .cse1 (exists ((aux_div_v_ULTIMATE.start_main_~d~0_28_37 Int) (aux_mod_v_ULTIMATE.start_main_~d~0_28_37 Int)) (and (<= (+ (* 4 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (* 2 aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) ULTIMATE.start_main_~d~0) (<= 1 aux_div_v_ULTIMATE.start_main_~d~0_28_37) (< aux_mod_v_ULTIMATE.start_main_~d~0_28_37 2) (<= 0 aux_mod_v_ULTIMATE.start_main_~d~0_28_37))) .cse2 .cse3 .cse4 .cse5 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and .cse6 .cse0 (= ULTIMATE.start_main_~d~0 2) .cse1 (= ULTIMATE.start_main_~p~0 2) .cse2 .cse3 .cse4 .cse5) (and .cse6 (= ULTIMATE.start_main_~B~0 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~p~0 1) .cse2 .cse3 .cse5 .cse4 (= ULTIMATE.start_main_~d~0 1)))) [2020-11-29 21:11:55,469 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-11-29 21:11:55,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:11:55 BoogieIcfgContainer [2020-11-29 21:11:55,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 21:11:55,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 21:11:55,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 21:11:55,525 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 21:11:55,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:11:44" (3/4) ... [2020-11-29 21:11:55,530 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 21:11:55,548 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2020-11-29 21:11:55,548 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-29 21:11:55,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 21:11:55,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 21:11:55,587 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((p == 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r) || ((((((((0 <= A && d == p * B) && d == 2) && 1 == cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2)) || (((((((0 <= A && B == d) && p == 1) && q == 0) && cond == 1) && A <= 2) && A == r) && d == 1) [2020-11-29 21:11:55,587 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 <= A && d == 2) && 1 <= cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) || ((((((((p == 4 && d == B * 4) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && 1 <= cond) && B == d) && p == 1) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) [2020-11-29 21:11:55,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0 == cond) && A == d + r) && B == d) && p == 1) && q == p) && d == 1) || (((((d == 2 && 1 <= cond) && p == 2) && q == 0) && A == r) && B * 2 == d)) || ((((((((!(0 == cond) && r < d) && q == 2) && B == d) && 2 <= A) && p == 1) && A == r + 2) && cond == 1) && d == 1)) || ((((((((d == p * B && d == 2) && A == d + r) && 1 <= cond) && 2 <= A) && q == p) && p == 2) && cond == 1) && A <= 2)) || (((((B == 1 && 1 <= cond) && B == d) && p == 1) && q == 0) && A == r)) || ((((((((p == 4 && d == p * -1 / -2 * B * 2) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r) [2020-11-29 21:11:55,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 <= A && d == 2) && 1 <= cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) || ((((((((p == 4 && d == B * 4) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && 1 <= cond) && B == d) && p == 1) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) [2020-11-29 21:11:55,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((d == 2 && 1 <= cond) && p == 2) && q == 0) && A == r) && B * 2 == d) || (((((B == 1 && 1 <= cond) && B == d) && p == 1) && q == 0) && A == r)) || ((((((((p == 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || (((((A == d + r && 1 <= cond) && B == d) && q == p) && p == 1) && d == 1)) || ((((((((B == 1 && q == 2) && 1 == cond) && 2 <= A) && B == d) && A == r + 2) && p == 1) && cond == 1) && A <= 2)) || ((((((((d == p * B && d == 2) && 1 == cond) && A == d + r) && 2 <= A) && q == p) && p == 2) && cond == 1) && A <= 2) [2020-11-29 21:11:55,590 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 <= A && d == p * B) && 1 == cond) && B == d) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) || ((((((((d == B * 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && d == 2) && 1 == cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) [2020-11-29 21:11:55,615 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0282438a-6aa8-4d84-ae07-5d2f25d004b5/bin/uautomizer/witness.graphml [2020-11-29 21:11:55,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 21:11:55,619 INFO L168 Benchmark]: Toolchain (without parser) took 11915.22 ms. Allocated memory was 98.6 MB in the beginning and 151.0 MB in the end (delta: 52.4 MB). Free memory was 68.7 MB in the beginning and 106.3 MB in the end (delta: -37.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-11-29 21:11:55,620 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 77.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:11:55,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.34 ms. Allocated memory is still 98.6 MB. Free memory was 68.5 MB in the beginning and 75.6 MB in the end (delta: -7.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2020-11-29 21:11:55,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.14 ms. Allocated memory is still 98.6 MB. Free memory was 75.6 MB in the beginning and 73.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:11:55,621 INFO L168 Benchmark]: Boogie Preprocessor took 32.11 ms. Allocated memory is still 98.6 MB. Free memory was 73.9 MB in the beginning and 72.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:11:55,622 INFO L168 Benchmark]: RCFGBuilder took 400.67 ms. Allocated memory is still 98.6 MB. Free memory was 72.8 MB in the beginning and 57.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 21:11:55,623 INFO L168 Benchmark]: TraceAbstraction took 11045.72 ms. Allocated memory was 98.6 MB in the beginning and 151.0 MB in the end (delta: 52.4 MB). Free memory was 56.8 MB in the beginning and 109.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. [2020-11-29 21:11:55,623 INFO L168 Benchmark]: Witness Printer took 94.02 ms. Allocated memory is still 151.0 MB. Free memory was 109.4 MB in the beginning and 106.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 21:11:55,625 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.26 ms. Allocated memory is still 77.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.34 ms. Allocated memory is still 98.6 MB. Free memory was 68.5 MB in the beginning and 75.6 MB in the end (delta: -7.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.14 ms. Allocated memory is still 98.6 MB. Free memory was 75.6 MB in the beginning and 73.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.11 ms. Allocated memory is still 98.6 MB. Free memory was 73.9 MB in the beginning and 72.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 400.67 ms. Allocated memory is still 98.6 MB. Free memory was 72.8 MB in the beginning and 57.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11045.72 ms. Allocated memory was 98.6 MB in the beginning and 151.0 MB in the end (delta: 52.4 MB). Free memory was 56.8 MB in the beginning and 109.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. * Witness Printer took 94.02 ms. Allocated memory is still 151.0 MB. Free memory was 109.4 MB in the beginning and 106.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2020-11-29 21:11:55,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((0 <= A && d == p * B) && 1 == cond) && B == d) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) || ((((((((d == B * 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && d == 2) && 1 == cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) - InvariantResult [Line: 34]: Loop Invariant [2020-11-29 21:11:55,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((p == 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r) || ((((((((0 <= A && d == p * B) && d == 2) && 1 == cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2)) || (((((((0 <= A && B == d) && p == 1) && q == 0) && cond == 1) && A <= 2) && A == r) && d == 1) - InvariantResult [Line: 48]: Loop Invariant [2020-11-29 21:11:55,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((d == 2 && 1 <= cond) && p == 2) && q == 0) && A == r) && B * 2 == d) || (((((B == 1 && 1 <= cond) && B == d) && p == 1) && q == 0) && A == r)) || ((((((((p == 4 && d == p * B) && 1 == cond) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || (((((A == d + r && 1 <= cond) && B == d) && q == p) && p == 1) && d == 1)) || ((((((((B == 1 && q == 2) && 1 == cond) && 2 <= A) && B == d) && A == r + 2) && p == 1) && cond == 1) && A <= 2)) || ((((((((d == p * B && d == 2) && 1 == cond) && A == d + r) && 2 <= A) && q == p) && p == 2) && cond == 1) && A <= 2) - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 21:11:55,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((0 <= A && d == 2) && 1 <= cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) || ((((((((p == 4 && d == B * 4) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && 1 <= cond) && B == d) && p == 1) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 21:11:55,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((!(0 == cond) && A == d + r) && B == d) && p == 1) && q == p) && d == 1) || (((((d == 2 && 1 <= cond) && p == 2) && q == 0) && A == r) && B * 2 == d)) || ((((((((!(0 == cond) && r < d) && q == 2) && B == d) && 2 <= A) && p == 1) && A == r + 2) && cond == 1) && d == 1)) || ((((((((d == p * B && d == 2) && A == d + r) && 1 <= cond) && 2 <= A) && q == p) && p == 2) && cond == 1) && A <= 2)) || (((((B == 1 && 1 <= cond) && B == d) && p == 1) && q == 0) && A == r)) || ((((((((p == 4 && d == p * -1 / -2 * B * 2) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r) - InvariantResult [Line: 14]: Loop Invariant [2020-11-29 21:11:55,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] [2020-11-29 21:11:55,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_ULTIMATE.start_main_~d~0_28_37,QUANTIFIED] Derived loop invariant: (((((((((0 <= A && d == 2) && 1 <= cond) && p == 2) && q == 0) && cond == 1) && A == r) && A <= 2) && B * 2 == d) || ((((((((p == 4 && d == B * 4) && (\exists aux_div_v_ULTIMATE.start_main_~d~0_28_37 : int, aux_mod_v_ULTIMATE.start_main_~d~0_28_37 : int :: ((4 * aux_div_v_ULTIMATE.start_main_~d~0_28_37 + 2 * aux_mod_v_ULTIMATE.start_main_~d~0_28_37 <= d && 1 <= aux_div_v_ULTIMATE.start_main_~d~0_28_37) && aux_mod_v_ULTIMATE.start_main_~d~0_28_37 < 2) && 0 <= aux_mod_v_ULTIMATE.start_main_~d~0_28_37)) && 1 <= cond) && q == 0) && cond == 1) && A == r) && A <= 2) && d * -1 / -2 <= r)) || ((((((((0 <= A && 1 <= cond) && B == d) && p == 1) && q == 0) && cond == 1) && A == r) && A <= 2) && d == 1) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((B == 1 && !(0 == cond)) && B == d) && p == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.9s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 336 SDtfs, 455 SDslu, 638 SDs, 0 SdLazy, 1225 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 260 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 37 NumberOfFragments, 815 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1620 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1047 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 341 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 327 ConstructedInterpolants, 13 QuantifiedInterpolants, 112788 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 92/207 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...