./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:09:51,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:09:51,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:09:51,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:09:51,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:09:51,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:09:51,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:09:51,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:09:51,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:09:51,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:09:51,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:09:51,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:09:51,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:09:51,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:09:51,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:09:51,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:09:51,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:09:51,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:09:51,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:09:51,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:09:51,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:09:51,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:09:51,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:09:51,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:09:51,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:09:51,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:09:51,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:09:51,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:09:51,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:09:51,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:09:51,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:09:51,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:09:51,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:09:51,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:09:51,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:09:51,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:09:51,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:09:51,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:09:51,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:09:51,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:09:51,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:09:51,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:09:51,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:09:51,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:09:51,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:09:51,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:09:51,950 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:09:51,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:09:51,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:09:51,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:09:51,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:09:51,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:09:51,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:09:51,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:09:51,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:09:51,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:09:51,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:09:51,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:09:51,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:09:51,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:09:51,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:09:51,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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(__VERIFIER_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 -> 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 [2019-12-07 15:09:52,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:09:52,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:09:52,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:09:52,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:09:52,068 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:09:52,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2019-12-07 15:09:52,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/data/181bb5783/362523fe78344325a20bbb946ce81dd1/FLAG9d97f333a [2019-12-07 15:09:52,514 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:09:52,514 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2019-12-07 15:09:52,518 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/data/181bb5783/362523fe78344325a20bbb946ce81dd1/FLAG9d97f333a [2019-12-07 15:09:52,528 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/data/181bb5783/362523fe78344325a20bbb946ce81dd1 [2019-12-07 15:09:52,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:09:52,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:09:52,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:09:52,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:09:52,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:09:52,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52, skipping insertion in model container [2019-12-07 15:09:52,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:09:52,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:09:52,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:09:52,660 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:09:52,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:09:52,719 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:09:52,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52 WrapperNode [2019-12-07 15:09:52,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:09:52,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:09:52,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:09:52,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:09:52,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:09:52,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:09:52,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:09:52,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:09:52,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... [2019-12-07 15:09:52,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:09:52,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:09:52,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:09:52,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:09:52,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:09:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:09:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:09:52,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:09:52,949 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:09:52,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:09:52 BoogieIcfgContainer [2019-12-07 15:09:52,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:09:52,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:09:52,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:09:52,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:09:52,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:09:52" (1/3) ... [2019-12-07 15:09:52,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e6a0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:09:52, skipping insertion in model container [2019-12-07 15:09:52,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:09:52" (2/3) ... [2019-12-07 15:09:52,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e6a0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:09:52, skipping insertion in model container [2019-12-07 15:09:52,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:09:52" (3/3) ... [2019-12-07 15:09:52,956 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-12-07 15:09:52,964 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:09:52,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:09:52,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:09:52,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:09:52,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:09:52,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:09:52,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:09:52,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:09:52,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:09:52,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:09:52,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:09:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-07 15:09:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:09:53,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:53,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:09:53,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2019-12-07 15:09:53,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:53,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724073385] [2019-12-07 15:09:53,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:53,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724073385] [2019-12-07 15:09:53,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:09:53,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:09:53,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52493720] [2019-12-07 15:09:53,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 15:09:53,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:53,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 15:09:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:09:53,097 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-12-07 15:09:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:53,108 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2019-12-07 15:09:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 15:09:53,108 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-07 15:09:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:09:53,114 INFO L225 Difference]: With dead ends: 26 [2019-12-07 15:09:53,114 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 15:09:53,116 INFO L630 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 [2019-12-07 15:09:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 15:09:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 15:09:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 15:09:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2019-12-07 15:09:53,137 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2019-12-07 15:09:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:09:53,137 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-12-07 15:09:53,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 15:09:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2019-12-07 15:09:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:09:53,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:53,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:09:53,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2019-12-07 15:09:53,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:53,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900884594] [2019-12-07 15:09:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:53,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900884594] [2019-12-07 15:09:53,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:09:53,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:09:53,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340344882] [2019-12-07 15:09:53,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:09:53,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:09:53,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:53,202 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2019-12-07 15:09:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:53,250 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2019-12-07 15:09:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:09:53,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:09:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:09:53,252 INFO L225 Difference]: With dead ends: 22 [2019-12-07 15:09:53,252 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 15:09:53,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 15:09:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 15:09:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 15:09:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2019-12-07 15:09:53,257 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2019-12-07 15:09:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:09:53,257 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2019-12-07 15:09:53,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:09:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2019-12-07 15:09:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:09:53,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:53,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:53,258 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2019-12-07 15:09:53,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:53,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409512821] [2019-12-07 15:09:53,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:55,324 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2019-12-07 15:09:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:55,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409512821] [2019-12-07 15:09:55,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:09:55,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:09:55,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764711253] [2019-12-07 15:09:55,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:09:55,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:09:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:55,328 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2019-12-07 15:09:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:55,416 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2019-12-07 15:09:55,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:09:55,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 15:09:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:09:55,417 INFO L225 Difference]: With dead ends: 47 [2019-12-07 15:09:55,417 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 15:09:55,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 15:09:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-12-07 15:09:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 15:09:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-12-07 15:09:55,421 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2019-12-07 15:09:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:09:55,422 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-12-07 15:09:55,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:09:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2019-12-07 15:09:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:09:55,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:55,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:55,423 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2019-12-07 15:09:55,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:55,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320375539] [2019-12-07 15:09:55,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320375539] [2019-12-07 15:09:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738309258] [2019-12-07 15:09:55,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:09:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:55,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 15:09:55,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:55,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:09:55,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-07 15:09:55,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631965438] [2019-12-07 15:09:55,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 15:09:55,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 15:09:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:09:55,679 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 14 states. [2019-12-07 15:09:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:55,823 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-12-07 15:09:55,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:09:55,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-12-07 15:09:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:09:55,824 INFO L225 Difference]: With dead ends: 45 [2019-12-07 15:09:55,824 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 15:09:55,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:09:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 15:09:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-12-07 15:09:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:09:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-12-07 15:09:55,830 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2019-12-07 15:09:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:09:55,831 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-12-07 15:09:55,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 15:09:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-12-07 15:09:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:09:55,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:55,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:56,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:09:56,033 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1309266250, now seen corresponding path program 1 times [2019-12-07 15:09:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:56,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174140042] [2019-12-07 15:09:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:09:56,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174140042] [2019-12-07 15:09:56,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:09:56,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:09:56,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124147609] [2019-12-07 15:09:56,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:09:56,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:09:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:09:56,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:56,099 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 3 states. [2019-12-07 15:09:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:09:56,148 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-12-07 15:09:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:09:56,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 15:09:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:09:56,149 INFO L225 Difference]: With dead ends: 58 [2019-12-07 15:09:56,149 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 15:09:56,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:09:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 15:09:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-12-07 15:09:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:09:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-12-07 15:09:56,153 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2019-12-07 15:09:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:09:56,154 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-12-07 15:09:56,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:09:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-12-07 15:09:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:09:56,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:09:56,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:09:56,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:09:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:09:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2019-12-07 15:09:56,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:09:56,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916651353] [2019-12-07 15:09:56,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:09:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:09:58,314 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 18 [2019-12-07 15:10:00,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-12-07 15:10:02,345 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-12-07 15:10:04,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-12-07 15:10:06,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from false [2019-12-07 15:10:08,390 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from true [2019-12-07 15:10:14,503 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2019-12-07 15:10:16,540 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from true [2019-12-07 15:10:18,563 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) is different from true [2019-12-07 15:10:20,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (< .cse36 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from false [2019-12-07 15:10:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-12-07 15:10:20,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916651353] [2019-12-07 15:10:20,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030499740] [2019-12-07 15:10:20,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:10:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:20,630 WARN L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:10:20,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:20,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:10:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:20,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:20,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-12-07 15:10:20,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067649493] [2019-12-07 15:10:20,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 15:10:20,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 15:10:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=110, Unknown=8, NotChecked=182, Total=342 [2019-12-07 15:10:20,735 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 19 states. [2019-12-07 15:10:22,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (= c_ULTIMATE.start_main_~x~0 1) (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-12-07 15:10:24,770 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (= c_ULTIMATE.start_main_~x~0 1) (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from true [2019-12-07 15:10:26,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-12-07 15:10:28,797 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from true [2019-12-07 15:10:30,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-12-07 15:10:32,841 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (= c_ULTIMATE.start_main_~x~0 1) (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from true [2019-12-07 15:10:34,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from false [2019-12-07 15:10:36,894 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from true [2019-12-07 15:10:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:41,024 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-12-07 15:10:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:10:41,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-12-07 15:10:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:41,025 INFO L225 Difference]: With dead ends: 55 [2019-12-07 15:10:41,025 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 15:10:41,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=58, Invalid=130, Unknown=16, NotChecked=396, Total=600 [2019-12-07 15:10:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 15:10:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 15:10:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 15:10:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-12-07 15:10:41,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2019-12-07 15:10:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:41,028 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-12-07 15:10:41,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 15:10:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-12-07 15:10:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:10:41,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:41,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 15:10:41,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:41,230 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 489860484, now seen corresponding path program 2 times [2019-12-07 15:10:41,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:41,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087260593] [2019-12-07 15:10:41,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:41,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087260593] [2019-12-07 15:10:41,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982612934] [2019-12-07 15:10:41,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:10:41,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:10:41,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:41,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 15:10:41,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:41,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:41,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-07 15:10:41,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617634539] [2019-12-07 15:10:41,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:10:41,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:10:41,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:10:41,576 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 24 states. [2019-12-07 15:10:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:41,815 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-12-07 15:10:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 15:10:41,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-07 15:10:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:41,816 INFO L225 Difference]: With dead ends: 44 [2019-12-07 15:10:41,816 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 15:10:41,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:10:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 15:10:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-12-07 15:10:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:10:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-12-07 15:10:41,820 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 27 [2019-12-07 15:10:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:41,820 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-12-07 15:10:41,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:10:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-12-07 15:10:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 15:10:41,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:41,821 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 15:10:42,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:42,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash 902325004, now seen corresponding path program 3 times [2019-12-07 15:10:42,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:42,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006773980] [2019-12-07 15:10:42,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:42,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006773980] [2019-12-07 15:10:42,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817752065] [2019-12-07 15:10:42,525 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:10:42,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 15:10:42,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:42,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 15:10:42,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:42,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:42,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-07 15:10:42,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139505864] [2019-12-07 15:10:42,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 15:10:42,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 15:10:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 15:10:42,607 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2019-12-07 15:10:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:43,093 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-12-07 15:10:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 15:10:43,094 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-12-07 15:10:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:43,094 INFO L225 Difference]: With dead ends: 55 [2019-12-07 15:10:43,094 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 15:10:43,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 15:10:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 15:10:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-12-07 15:10:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 15:10:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-12-07 15:10:43,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 38 [2019-12-07 15:10:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:43,099 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-12-07 15:10:43,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 15:10:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-12-07 15:10:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:10:43,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:43,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-12-07 15:10:43,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:43,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 241133700, now seen corresponding path program 4 times [2019-12-07 15:10:43,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:43,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630531876] [2019-12-07 15:10:43,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:44,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630531876] [2019-12-07 15:10:44,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461138193] [2019-12-07 15:10:44,112 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:10:44,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:10:44,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:10:44,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-07 15:10:44,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:10:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:10:44,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:10:44,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-07 15:10:44,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230845313] [2019-12-07 15:10:44,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 15:10:44,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:10:44,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 15:10:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 15:10:44,195 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 44 states. [2019-12-07 15:10:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:10:44,997 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-12-07 15:10:44,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 15:10:44,997 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2019-12-07 15:10:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:10:44,998 INFO L225 Difference]: With dead ends: 66 [2019-12-07 15:10:44,998 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 15:10:44,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 15:10:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 15:10:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-12-07 15:10:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 15:10:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-12-07 15:10:45,003 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 49 [2019-12-07 15:10:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:10:45,003 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-12-07 15:10:45,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 15:10:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-12-07 15:10:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 15:10:45,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:10:45,005 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 15:10:45,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:10:45,205 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:10:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:10:45,206 INFO L82 PathProgramCache]: Analyzing trace with hash -722941940, now seen corresponding path program 5 times [2019-12-07 15:10:45,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:10:45,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292733439] [2019-12-07 15:10:45,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:10:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:10:47,321 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2019-12-07 15:10:49,365 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2019-12-07 15:10:53,511 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:10:55,567 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:10:59,635 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:01,699 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:03,761 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:05,843 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:07,923 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:09,994 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:12,071 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:16,164 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:20,259 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:24,358 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:26,548 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:30,649 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:32,835 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:37,031 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:39,132 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:43,252 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:47,365 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:49,473 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:51,592 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:53,704 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:55,941 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:11:58,063 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:00,197 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:02,315 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:06,462 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:10,737 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:12,889 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:17,187 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:19,526 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:23,698 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:27,873 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:30,059 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:34,240 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:38,405 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:42,587 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:12:44,778 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-12-07 15:13:17,385 WARN L192 SmtUtils]: Spent 18.22 s on a formula simplification. DAG size of input: 121 DAG size of output: 27 [2019-12-07 15:13:19,401 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse31 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (let ((.cse0 (div c_ULTIMATE.start_main_~x~0 2))) (let ((.cse13 (* 2 .cse0))) (let ((.cse1 (<= .cse31 c_ULTIMATE.start_main_~x~0)) (.cse2 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse30 (* .cse0 (- 2)))) (let ((.cse28 (div (+ .cse30 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse23 (or .cse1 .cse2)) (.cse21 (< c_ULTIMATE.start_main_~x~0 .cse31)) (.cse26 (div (+ .cse30 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (not .cse2))) (or (and (or (<= .cse0 49) (let ((.cse29 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse16 (* 2 .cse29)) (.cse27 (* .cse29 (- 2))) (.cse25 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse8 (<= .cse25 c_ULTIMATE.start_main_~y~0)) (.cse17 (* 4294967296 .cse28)) (.cse15 (* 4294967296 (div (+ .cse27 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (.cse9 (= .cse16 c_ULTIMATE.start_main_~y~0)) (.cse24 (* 4294967296 (div (+ .cse27 c_ULTIMATE.start_main_~y~0) 4294967296))) (.cse14 (* 4294967296 .cse26))) (let ((.cse11 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2)) (.cse10 (+ .cse16 c_ULTIMATE.start_main_~x~0 .cse24)) (.cse19 (not .cse9)) (.cse20 (< c_ULTIMATE.start_main_~y~0 .cse25)) (.cse4 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14)) (.cse3 (+ .cse15 .cse16 c_ULTIMATE.start_main_~x~0)) (.cse7 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse17)) (.cse6 (+ .cse15 .cse16 c_ULTIMATE.start_main_~x~0 2)) (.cse18 (or .cse8 .cse9))) (and (let ((.cse12 (and .cse19 .cse20)) (.cse5 (and .cse21 .cse22))) (or (and (or (and (or .cse1 .cse2 (< .cse3 .cse4)) (or .cse5 (< .cse6 .cse7))) .cse8 .cse9) (or (and (or .cse1 (< .cse10 .cse11) .cse2) (or .cse5 (< .cse10 .cse7))) .cse12)) (and (or .cse8 (and (or .cse1 (< .cse3 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1)) .cse2) (or .cse5 (< (+ .cse15 .cse16 c_ULTIMATE.start_main_~x~0 1) .cse7))) .cse9) (or .cse12 (and (or .cse5 (< .cse10 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse17 1))) (or (< .cse10 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3)) .cse1 .cse2)))) (and (<= .cse10 (+ c_ULTIMATE.start_main_~y~0 100)) .cse18) (and .cse19 .cse20 (<= .cse3 (+ c_ULTIMATE.start_main_~y~0 98))))) (or (and (or (and .cse21 (<= .cse11 .cse10) .cse22) (and .cse23 (<= .cse7 .cse10))) .cse18) (and .cse19 .cse20 (<= c_ULTIMATE.start_main_~y~0 (+ .cse15 .cse16 2))) (and .cse19 .cse20 (or (and .cse21 (<= .cse4 .cse3) .cse22) (and .cse23 (<= .cse7 .cse6)))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse16 .cse24)) .cse18)))))))) (or (< 49 .cse0) (<= 100 c_ULTIMATE.start_main_~x~0))) (and (<= (+ .cse28 1) 0) .cse23) (and .cse21 (<= (+ .cse26 1) 0) .cse22)))))) (< .cse31 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from true [2019-12-07 15:13:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 113 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:13:19,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292733439] [2019-12-07 15:13:19,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438472789] [2019-12-07 15:13:19,485 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/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 [2019-12-07 15:13:19,535 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 15:13:19,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:13:19,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 109 conjunts are in the unsatisfiable core [2019-12-07 15:13:19,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:13:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:13:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:13:19,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:13:19,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 59 [2019-12-07 15:13:19,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250931294] [2019-12-07 15:13:19,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-07 15:13:19,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:13:19,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-07 15:13:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3296, Unknown=8, NotChecked=114, Total=3540 [2019-12-07 15:13:19,991 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-12-07 15:13:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:13:22,064 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-12-07 15:13:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 15:13:22,064 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-12-07 15:13:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:13:22,064 INFO L225 Difference]: With dead ends: 74 [2019-12-07 15:13:22,064 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:13:22,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 154.7s TimeCoverageRelationStatistics Valid=128, Invalid=3408, Unknown=8, NotChecked=116, Total=3660 [2019-12-07 15:13:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:13:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:13:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:13:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:13:22,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2019-12-07 15:13:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:13:22,066 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:13:22,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-07 15:13:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:13:22,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:13:22,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:13:22,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L31-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L19-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L15-2(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L40-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L28-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-12-07 15:13:22,372 INFO L246 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L16-2(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L37-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L25-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L249 CegarLoopResult]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L34-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L22-1(lines 15 45) no Hoare annotation was computed. [2019-12-07 15:13:22,373 INFO L242 CegarLoopResult]: At program point L43-1(lines 15 45) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_main_~y~0 2))) (let ((.cse2 (div (+ (* .cse1 (- 2)) ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse4 (* 2 .cse1)) (.cse5 (* 4294967296 .cse2))) (let ((.cse0 (<= ULTIMATE.start_main_~y~0 (+ .cse4 .cse5))) (.cse3 (+ .cse4 ULTIMATE.start_main_~x~0 .cse5))) (or (and .cse0 (<= ULTIMATE.start_main_~x~0 60) (<= 60 ULTIMATE.start_main_~x~0)) (and (<= 40 ULTIMATE.start_main_~x~0) .cse0 (<= ULTIMATE.start_main_~x~0 40)) (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (not (= ULTIMATE.start_main_~y~0 (+ (* .cse1 2) (* .cse2 4294967296)))) (= 0 (+ ULTIMATE.start_main_~x~0 5))) (and (<= .cse3 (+ ULTIMATE.start_main_~y~0 20)) .cse0 (<= 20 ULTIMATE.start_main_~x~0)) (and (<= .cse3 (+ ULTIMATE.start_main_~y~0 100)) .cse0 (<= 100 ULTIMATE.start_main_~x~0)) (and .cse0 (<= .cse3 (+ ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0))))))) [2019-12-07 15:13:22,373 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-12-07 15:13:22,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:13:22 BoogieIcfgContainer [2019-12-07 15:13:22,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:13:22,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:13:22,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:13:22,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:13:22,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:09:52" (3/4) ... [2019-12-07 15:13:22,389 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:13:22,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 15:13:22,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:13:22,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fe6d287e-73b1-47e5-a4c9-ad3dca077dde/bin/uautomizer/witness.graphml [2019-12-07 15:13:22,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:13:22,427 INFO L168 Benchmark]: Toolchain (without parser) took 209896.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:13:22,428 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:13:22,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:13:22,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:13:22,428 INFO L168 Benchmark]: Boogie Preprocessor took 13.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:13:22,429 INFO L168 Benchmark]: RCFGBuilder took 191.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:13:22,429 INFO L168 Benchmark]: TraceAbstraction took 209435.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.2 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:13:22,429 INFO L168 Benchmark]: Witness Printer took 40.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:13:22,430 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 191.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209435.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.2 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. * Witness Printer took 40.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296) && x <= 60) && 60 <= x) || ((40 <= x && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && x <= 40)) || (x <= 0 && 0 <= x)) || (!(y == y / 2 * 2 + (y / 2 * -2 + y) / 4294967296 * 4294967296) && 0 == x + 5)) || ((2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 20 && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && 20 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 100 && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && 100 <= x)) || ((y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296) && 2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 80) && 80 <= x) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 209.2s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 127 SDtfs, 49 SDslu, 227 SDs, 0 SdLazy, 7362 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 194 SyntacticMatches, 16 SemanticMatches, 193 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 202.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 222 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 154 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 183.1s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 522665 SizeOfPredicates, 12 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 2/474 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...