./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits.i --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_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 a69112b8d023c6203418abb04301ebe890b3a5f5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 a69112b8d023c6203418abb04301ebe890b3a5f5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:49:05,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:49:05,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:49:05,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:49:05,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:49:05,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:49:05,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:49:05,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:49:05,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:49:05,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:49:05,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:49:05,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:49:05,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:49:05,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:49:05,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:49:05,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:49:05,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:49:05,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:49:05,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:49:05,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:49:05,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:49:05,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:49:05,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:49:05,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:49:05,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:49:05,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:49:05,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:49:05,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:49:05,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:49:05,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:49:05,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:49:05,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:49:05,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:49:05,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:49:05,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:49:05,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:49:05,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:49:05,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:49:05,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:49:05,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:49:05,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:49:05,067 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:49:05,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:49:05,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:49:05,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:49:05,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:49:05,077 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:49:05,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:49:05,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:49:05,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:49:05,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:49:05,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:49:05,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:49:05,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:49:05,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:49:05,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:49:05,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:49:05,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:49:05,080 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_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2019-12-07 10:49:05,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:49:05,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:49:05,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:49:05,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:49:05,195 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:49:05,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 10:49:05,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/362cb2ca2/60479942bea14d7d890c05e3393f9ee6/FLAG8a88153a8 [2019-12-07 10:49:05,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:49:05,673 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 10:49:05,676 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/362cb2ca2/60479942bea14d7d890c05e3393f9ee6/FLAG8a88153a8 [2019-12-07 10:49:05,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/362cb2ca2/60479942bea14d7d890c05e3393f9ee6 [2019-12-07 10:49:05,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:49:05,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:49:05,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:05,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:49:05,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:49:05,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712b2759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05, skipping insertion in model container [2019-12-07 10:49:05,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:49:05,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:49:05,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:05,874 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:49:05,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:05,902 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:49:05,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05 WrapperNode [2019-12-07 10:49:05,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:05,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:05,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:49:05,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:49:05,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:05,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:49:05,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:49:05,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:49:05,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... [2019-12-07 10:49:05,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:49:05,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:49:05,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:49:05,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:49:05,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:49:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:49:06,074 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:49:06,074 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:49:06,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:06 BoogieIcfgContainer [2019-12-07 10:49:06,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:49:06,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:49:06,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:49:06,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:49:06,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:49:05" (1/3) ... [2019-12-07 10:49:06,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646c8eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:06, skipping insertion in model container [2019-12-07 10:49:06,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:05" (2/3) ... [2019-12-07 10:49:06,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646c8eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:06, skipping insertion in model container [2019-12-07 10:49:06,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:06" (3/3) ... [2019-12-07 10:49:06,079 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-12-07 10:49:06,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:49:06,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:49:06,096 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:49:06,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:49:06,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:49:06,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:49:06,111 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:49:06,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:49:06,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:49:06,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:49:06,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:49:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-12-07 10:49:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:49:06,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:06,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:49:06,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-12-07 10:49:06,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:06,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005687090] [2019-12-07 10:49:06,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:06,254 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 10:49:06,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005687090] [2019-12-07 10:49:06,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:06,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:49:06,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512641130] [2019-12-07 10:49:06,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:49:06,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:49:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:49:06,269 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-12-07 10:49:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:06,285 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-12-07 10:49:06,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:49:06,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:49:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:06,292 INFO L225 Difference]: With dead ends: 17 [2019-12-07 10:49:06,292 INFO L226 Difference]: Without dead ends: 7 [2019-12-07 10:49:06,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:49:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-12-07 10:49:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-12-07 10:49:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 10:49:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-12-07 10:49:06,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-12-07 10:49:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:06,315 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-12-07 10:49:06,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:49:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-12-07 10:49:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 10:49:06,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:06,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:49:06,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-12-07 10:49:06,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:06,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687859585] [2019-12-07 10:49:06,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:06,364 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 10:49:06,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687859585] [2019-12-07 10:49:06,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429941732] [2019-12-07 10:49:06,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:06,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:49:06,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:06,418 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 10:49:06,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:06,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-12-07 10:49:06,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822612709] [2019-12-07 10:49:06,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:49:06,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:49:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:49:06,420 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-12-07 10:49:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:06,430 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-12-07 10:49:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:49:06,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 10:49:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:06,431 INFO L225 Difference]: With dead ends: 12 [2019-12-07 10:49:06,431 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 10:49:06,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:49:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 10:49:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 10:49:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 10:49:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-12-07 10:49:06,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-12-07 10:49:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:06,434 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-12-07 10:49:06,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:49:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-12-07 10:49:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:49:06,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:06,434 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 10:49:06,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:06,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2019-12-07 10:49:06,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:06,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946022631] [2019-12-07 10:49:06,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946022631] [2019-12-07 10:49:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375540871] [2019-12-07 10:49:06,714 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:06,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:49:06,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:06,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:49:06,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:06,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:06,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 10:49:06,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977223071] [2019-12-07 10:49:06,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:49:06,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:49:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:49:06,751 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-12-07 10:49:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:06,769 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-12-07 10:49:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:49:06,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 10:49:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:06,770 INFO L225 Difference]: With dead ends: 13 [2019-12-07 10:49:06,770 INFO L226 Difference]: Without dead ends: 9 [2019-12-07 10:49:06,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:49:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-12-07 10:49:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 10:49:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 10:49:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-12-07 10:49:06,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-12-07 10:49:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:06,773 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-12-07 10:49:06,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:49:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-12-07 10:49:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 10:49:06,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:06,773 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-12-07 10:49:06,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:06,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2019-12-07 10:49:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718736493] [2019-12-07 10:49:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718736493] [2019-12-07 10:49:07,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179215387] [2019-12-07 10:49:07,053 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:07,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 10:49:07,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:07,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:49:07,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:07,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 10:49:07,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501887051] [2019-12-07 10:49:07,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:49:07,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:49:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:49:07,090 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-12-07 10:49:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:07,112 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-12-07 10:49:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:49:07,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-12-07 10:49:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:07,114 INFO L225 Difference]: With dead ends: 14 [2019-12-07 10:49:07,114 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 10:49:07,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:49:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 10:49:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 10:49:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 10:49:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-12-07 10:49:07,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-12-07 10:49:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:07,117 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-12-07 10:49:07,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:49:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-12-07 10:49:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:49:07,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:07,118 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-12-07 10:49:07,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:07,319 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2019-12-07 10:49:07,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:07,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085405524] [2019-12-07 10:49:07,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085405524] [2019-12-07 10:49:07,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160527675] [2019-12-07 10:49:07,402 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:07,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:49:07,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:07,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:49:07,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:07,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 10:49:07,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534934960] [2019-12-07 10:49:07,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:49:07,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:49:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:49:07,435 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-12-07 10:49:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:07,459 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-12-07 10:49:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:49:07,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 10:49:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:07,460 INFO L225 Difference]: With dead ends: 15 [2019-12-07 10:49:07,460 INFO L226 Difference]: Without dead ends: 11 [2019-12-07 10:49:07,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:49:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-07 10:49:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-07 10:49:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 10:49:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-12-07 10:49:07,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-12-07 10:49:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:07,463 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-12-07 10:49:07,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:49:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-12-07 10:49:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:49:07,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:07,463 INFO L410 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-12-07 10:49:07,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:07,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2019-12-07 10:49:07,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:07,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32732654] [2019-12-07 10:49:07,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32732654] [2019-12-07 10:49:07,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952909278] [2019-12-07 10:49:07,729 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:07,752 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 10:49:07,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:07,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 10:49:07,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:07,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:07,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 10:49:07,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812122601] [2019-12-07 10:49:07,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:49:07,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:49:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:49:07,769 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-12-07 10:49:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:07,801 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-12-07 10:49:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:49:07,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-12-07 10:49:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:07,802 INFO L225 Difference]: With dead ends: 16 [2019-12-07 10:49:07,802 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 10:49:07,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:49:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 10:49:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 10:49:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 10:49:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-12-07 10:49:07,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-12-07 10:49:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:07,805 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-12-07 10:49:07,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:49:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-12-07 10:49:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:49:07,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:07,805 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-12-07 10:49:08,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:08,007 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2019-12-07 10:49:08,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:08,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588091998] [2019-12-07 10:49:08,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:08,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588091998] [2019-12-07 10:49:08,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12013346] [2019-12-07 10:49:08,115 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:08,135 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 10:49:08,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:08,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 10:49:08,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:08,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:08,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 10:49:08,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021446371] [2019-12-07 10:49:08,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:49:08,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:49:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:49:08,156 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-12-07 10:49:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:08,194 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-12-07 10:49:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:49:08,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-12-07 10:49:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:08,195 INFO L225 Difference]: With dead ends: 17 [2019-12-07 10:49:08,195 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 10:49:08,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:49:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 10:49:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 10:49:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 10:49:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-12-07 10:49:08,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-12-07 10:49:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:08,198 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-12-07 10:49:08,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:49:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-12-07 10:49:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:49:08,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:08,199 INFO L410 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-12-07 10:49:08,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:08,400 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1310307538, now seen corresponding path program 7 times [2019-12-07 10:49:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:08,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454170373] [2019-12-07 10:49:08,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:08,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454170373] [2019-12-07 10:49:08,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221752686] [2019-12-07 10:49:08,571 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:08,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:49:08,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:08,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:08,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-07 10:49:08,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605459118] [2019-12-07 10:49:08,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:49:08,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:49:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:49:08,613 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-12-07 10:49:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:08,650 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-12-07 10:49:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:49:08,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-12-07 10:49:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:08,651 INFO L225 Difference]: With dead ends: 18 [2019-12-07 10:49:08,651 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 10:49:08,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:49:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 10:49:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 10:49:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:49:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-12-07 10:49:08,653 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-12-07 10:49:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:08,654 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-12-07 10:49:08,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:49:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-12-07 10:49:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:49:08,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:08,654 INFO L410 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-12-07 10:49:08,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:08,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 8 times [2019-12-07 10:49:08,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:08,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295609488] [2019-12-07 10:49:08,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:09,096 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 10:49:09,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295609488] [2019-12-07 10:49:09,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662091204] [2019-12-07 10:49:09,098 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:09,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:49:09,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:09,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 10:49:09,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:09,156 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 10:49:09,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:09,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-07 10:49:09,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379007707] [2019-12-07 10:49:09,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:49:09,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:49:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:49:09,157 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-12-07 10:49:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:09,205 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-12-07 10:49:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:49:09,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 10:49:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:09,206 INFO L225 Difference]: With dead ends: 19 [2019-12-07 10:49:09,206 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 10:49:09,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:49:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 10:49:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 10:49:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 10:49:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-12-07 10:49:09,208 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-12-07 10:49:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:09,208 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-12-07 10:49:09,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:49:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-12-07 10:49:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:49:09,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:09,209 INFO L410 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-12-07 10:49:09,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:09,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 833418130, now seen corresponding path program 9 times [2019-12-07 10:49:09,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:09,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781489420] [2019-12-07 10:49:09,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:09,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781489420] [2019-12-07 10:49:09,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602039771] [2019-12-07 10:49:09,534 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:09,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 10:49:09,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:09,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:49:09,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:09,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:09,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-07 10:49:09,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645823907] [2019-12-07 10:49:09,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:49:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:09,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:49:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:49:09,604 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-12-07 10:49:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:09,677 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-12-07 10:49:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:49:09,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-12-07 10:49:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:09,678 INFO L225 Difference]: With dead ends: 20 [2019-12-07 10:49:09,678 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 10:49:09,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:49:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 10:49:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 10:49:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 10:49:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-12-07 10:49:09,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-12-07 10:49:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:09,681 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-12-07 10:49:09,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:49:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-12-07 10:49:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:49:09,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:09,682 INFO L410 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-12-07 10:49:09,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:09,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash 67823624, now seen corresponding path program 10 times [2019-12-07 10:49:09,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:09,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887096808] [2019-12-07 10:49:09,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:09,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887096808] [2019-12-07 10:49:09,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228382238] [2019-12-07 10:49:09,989 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:10,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:49:10,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:10,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 10:49:10,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:10,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:10,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-07 10:49:10,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947471096] [2019-12-07 10:49:10,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:49:10,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:49:10,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:49:10,026 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-12-07 10:49:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:10,082 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-12-07 10:49:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:49:10,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-07 10:49:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:10,083 INFO L225 Difference]: With dead ends: 21 [2019-12-07 10:49:10,083 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 10:49:10,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:49:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 10:49:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 10:49:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 10:49:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-12-07 10:49:10,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-12-07 10:49:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:10,086 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-12-07 10:49:10,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:49:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-12-07 10:49:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:49:10,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:10,086 INFO L410 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-12-07 10:49:10,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:10,287 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2104197714, now seen corresponding path program 11 times [2019-12-07 10:49:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:10,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716298721] [2019-12-07 10:49:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:10,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716298721] [2019-12-07 10:49:10,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782182745] [2019-12-07 10:49:10,421 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:10,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-07 10:49:10,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:10,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:49:10,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:10,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:10,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-07 10:49:10,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42310521] [2019-12-07 10:49:10,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:49:10,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:49:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:49:10,484 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-12-07 10:49:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:10,565 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-12-07 10:49:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:49:10,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-12-07 10:49:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:10,566 INFO L225 Difference]: With dead ends: 22 [2019-12-07 10:49:10,566 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 10:49:10,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:49:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 10:49:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 10:49:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 10:49:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-12-07 10:49:10,568 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-12-07 10:49:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:10,569 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-12-07 10:49:10,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:49:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-12-07 10:49:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:49:10,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:10,569 INFO L410 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-12-07 10:49:10,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:10,770 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 807285064, now seen corresponding path program 12 times [2019-12-07 10:49:10,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:10,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744878755] [2019-12-07 10:49:10,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:10,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744878755] [2019-12-07 10:49:10,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996595420] [2019-12-07 10:49:10,895 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:10,934 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 10:49:10,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:10,935 WARN L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:49:10,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:10,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:10,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-07 10:49:10,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079818799] [2019-12-07 10:49:10,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:49:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:49:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:49:10,959 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-12-07 10:49:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:11,039 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-12-07 10:49:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:49:11,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-07 10:49:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:11,040 INFO L225 Difference]: With dead ends: 23 [2019-12-07 10:49:11,040 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 10:49:11,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:49:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 10:49:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 10:49:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 10:49:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-12-07 10:49:11,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-12-07 10:49:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:11,043 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-12-07 10:49:11,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:49:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-12-07 10:49:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:49:11,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:11,044 INFO L410 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-12-07 10:49:11,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:11,245 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash -742301422, now seen corresponding path program 13 times [2019-12-07 10:49:11,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:11,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966208190] [2019-12-07 10:49:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:11,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966208190] [2019-12-07 10:49:11,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815841175] [2019-12-07 10:49:11,404 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:11,423 WARN L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 10:49:11,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:11,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:11,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-07 10:49:11,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105167369] [2019-12-07 10:49:11,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:49:11,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:11,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:49:11,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:49:11,444 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-12-07 10:49:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:11,540 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-12-07 10:49:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:49:11,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-12-07 10:49:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:11,542 INFO L225 Difference]: With dead ends: 24 [2019-12-07 10:49:11,542 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 10:49:11,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:49:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 10:49:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 10:49:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:49:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-12-07 10:49:11,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-12-07 10:49:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:11,545 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-12-07 10:49:11,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:49:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-12-07 10:49:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:49:11,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:11,546 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-12-07 10:49:11,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:11,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 14 times [2019-12-07 10:49:11,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:11,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842746512] [2019-12-07 10:49:11,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:11,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842746512] [2019-12-07 10:49:11,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736634017] [2019-12-07 10:49:11,915 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:11,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:49:11,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:11,935 WARN L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 10:49:11,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:11,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:11,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-07 10:49:11,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477497759] [2019-12-07 10:49:11,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:49:11,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:49:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:49:11,957 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-12-07 10:49:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:12,050 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-12-07 10:49:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:49:12,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-07 10:49:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:12,050 INFO L225 Difference]: With dead ends: 25 [2019-12-07 10:49:12,050 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 10:49:12,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:49:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 10:49:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 10:49:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 10:49:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-12-07 10:49:12,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-12-07 10:49:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:12,054 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-12-07 10:49:12,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:49:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-12-07 10:49:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:49:12,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:12,054 INFO L410 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-12-07 10:49:12,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:12,255 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -333803566, now seen corresponding path program 15 times [2019-12-07 10:49:12,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:12,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422748044] [2019-12-07 10:49:12,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:12,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422748044] [2019-12-07 10:49:12,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528442232] [2019-12-07 10:49:12,447 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:12,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 10:49:12,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:12,540 WARN L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 10:49:12,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:12,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:12,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-07 10:49:12,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238396906] [2019-12-07 10:49:12,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:49:12,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:49:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:49:12,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:49:12,566 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-12-07 10:49:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:12,680 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-12-07 10:49:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:49:12,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-12-07 10:49:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:12,680 INFO L225 Difference]: With dead ends: 26 [2019-12-07 10:49:12,680 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 10:49:12,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:49:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 10:49:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 10:49:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 10:49:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-12-07 10:49:12,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-12-07 10:49:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:12,683 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-12-07 10:49:12,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:49:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-12-07 10:49:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:49:12,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:12,684 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-12-07 10:49:12,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:12,884 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 16 times [2019-12-07 10:49:12,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:49:12,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168832885] [2019-12-07 10:49:12,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:49:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:49:12,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:49:12,914 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:49:12,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:49:12 BoogieIcfgContainer [2019-12-07 10:49:12,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:49:12,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:49:12,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:49:12,930 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:49:12,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:06" (3/4) ... [2019-12-07 10:49:12,933 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:49:12,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:49:12,935 INFO L168 Benchmark]: Toolchain (without parser) took 7247.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 946.3 MB in the beginning and 987.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:12,935 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:12,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:12,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:12,936 INFO L168 Benchmark]: Boogie Preprocessor took 13.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:12,936 INFO L168 Benchmark]: RCFGBuilder took 133.97 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:12,936 INFO L168 Benchmark]: TraceAbstraction took 6854.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.9 MB). Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 132.3 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:12,936 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:12,938 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 133.97 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6854.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.9 MB). Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 132.3 MB). Peak memory consumption was 163.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND FALSE !(i < sizeof(x) * 8) [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.8s, OverallIterations: 17, TraceHistogramMax: 16, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 0 SDslu, 342 SDs, 0 SdLazy, 1722 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 166 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 28440 SizeOfPredicates, 15 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:49:14,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:49:14,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:49:14,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:49:14,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:49:14,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:49:14,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:49:14,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:49:14,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:49:14,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:49:14,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:49:14,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:49:14,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:49:14,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:49:14,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:49:14,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:49:14,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:49:14,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:49:14,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:49:14,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:49:14,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:49:14,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:49:14,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:49:14,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:49:14,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:49:14,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:49:14,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:49:14,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:49:14,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:49:14,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:49:14,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:49:14,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:49:14,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:49:14,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:49:14,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:49:14,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:49:14,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:49:14,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:49:14,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:49:14,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:49:14,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:49:14,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:49:14,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:49:14,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:49:14,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:49:14,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:49:14,338 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:49:14,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:49:14,339 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:49:14,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:49:14,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:49:14,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:49:14,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:49:14,342 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:49:14,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:49:14,342 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2019-12-07 10:49:14,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:49:14,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:49:14,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:49:14,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:49:14,513 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:49:14,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 10:49:14,559 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/d6d27a4bd/5aa36ea16a2c4a5790c14864229216dd/FLAG54a266cdb [2019-12-07 10:49:14,952 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:49:14,952 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 10:49:14,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/d6d27a4bd/5aa36ea16a2c4a5790c14864229216dd/FLAG54a266cdb [2019-12-07 10:49:15,336 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/data/d6d27a4bd/5aa36ea16a2c4a5790c14864229216dd [2019-12-07 10:49:15,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:49:15,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:49:15,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:15,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:49:15,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:49:15,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afbba0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15, skipping insertion in model container [2019-12-07 10:49:15,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:49:15,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:49:15,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:15,483 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:49:15,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:15,509 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:49:15,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15 WrapperNode [2019-12-07 10:49:15,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:15,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:15,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:49:15,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:49:15,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:15,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:49:15,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:49:15,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:49:15,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... [2019-12-07 10:49:15,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:49:15,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:49:15,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:49:15,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:49:15,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/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 10:49:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:49:15,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:49:15,730 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:49:15,730 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:49:15,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:15 BoogieIcfgContainer [2019-12-07 10:49:15,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:49:15,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:49:15,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:49:15,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:49:15,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:49:15" (1/3) ... [2019-12-07 10:49:15,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579d3cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:15, skipping insertion in model container [2019-12-07 10:49:15,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:15" (2/3) ... [2019-12-07 10:49:15,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579d3cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:15, skipping insertion in model container [2019-12-07 10:49:15,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:15" (3/3) ... [2019-12-07 10:49:15,736 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-12-07 10:49:15,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:49:15,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:49:15,753 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:49:15,767 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:49:15,767 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:49:15,767 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:49:15,767 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:49:15,768 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:49:15,768 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:49:15,768 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:49:15,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:49:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-12-07 10:49:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:49:15,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:15,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:49:15,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-12-07 10:49:15,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:49:15,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110697891] [2019-12-07 10:49:15,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:15,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:49:15,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:15,842 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 10:49:15,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:15,851 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 10:49:15,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110697891] [2019-12-07 10:49:15,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:15,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 10:49:15,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438552215] [2019-12-07 10:49:15,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:15,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:49:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:15,866 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-12-07 10:49:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:15,890 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-12-07 10:49:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:49:15,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 10:49:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:15,898 INFO L225 Difference]: With dead ends: 18 [2019-12-07 10:49:15,898 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 10:49:15,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 10:49:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 10:49:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 10:49:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-12-07 10:49:15,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-12-07 10:49:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:15,922 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-12-07 10:49:15,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-12-07 10:49:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:49:15,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:15,922 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 10:49:16,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,124 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2019-12-07 10:49:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:49:16,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148621733] [2019-12-07 10:49:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:16,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:49:16,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:16,196 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:16,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148621733] [2019-12-07 10:49:16,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:16,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-07 10:49:16,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496338020] [2019-12-07 10:49:16,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:49:16,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:49:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:49:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:49:16,240 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-12-07 10:49:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:16,337 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-12-07 10:49:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:49:16,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-12-07 10:49:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:16,338 INFO L225 Difference]: With dead ends: 16 [2019-12-07 10:49:16,338 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 10:49:16,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:49:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 10:49:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 10:49:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 10:49:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-12-07 10:49:16,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-12-07 10:49:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:16,343 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-12-07 10:49:16,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:49:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-12-07 10:49:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:49:16,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:16,343 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-12-07 10:49:16,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,544 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 2 times [2019-12-07 10:49:16,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:49:16,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979406192] [2019-12-07 10:49:16,546 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:49:16,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:16,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:49:16,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:16,669 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:16,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979406192] [2019-12-07 10:49:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:16,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 10:49:16,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983650005] [2019-12-07 10:49:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:49:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:49:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:49:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:49:16,860 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-12-07 10:49:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:17,345 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-12-07 10:49:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:49:17,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-12-07 10:49:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:17,346 INFO L225 Difference]: With dead ends: 24 [2019-12-07 10:49:17,347 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 10:49:17,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:49:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 10:49:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 10:49:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:49:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-12-07 10:49:17,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2019-12-07 10:49:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:17,352 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-12-07 10:49:17,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:49:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-12-07 10:49:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:49:17,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:17,353 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-12-07 10:49:17,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:49:17,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 3 times [2019-12-07 10:49:17,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:49:17,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964872404] [2019-12-07 10:49:17,556 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:17,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 10:49:17,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:17,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:49:17,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:17,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:18,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964872404] [2019-12-07 10:49:18,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:18,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-12-07 10:49:18,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353410974] [2019-12-07 10:49:18,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 10:49:18,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:49:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 10:49:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:49:18,893 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2019-12-07 10:49:19,396 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 10:49:19,818 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 10:49:20,266 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 10:49:20,559 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2019-12-07 10:49:20,864 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2019-12-07 10:49:21,140 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-12-07 10:49:21,408 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2019-12-07 10:49:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:22,978 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2019-12-07 10:49:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:49:22,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-12-07 10:49:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:22,980 INFO L225 Difference]: With dead ends: 40 [2019-12-07 10:49:22,980 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 10:49:22,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=622, Invalid=1540, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 10:49:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 10:49:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 10:49:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 10:49:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-12-07 10:49:22,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2019-12-07 10:49:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:22,986 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-12-07 10:49:22,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 10:49:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-12-07 10:49:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:49:22,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:22,987 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-12-07 10:49:23,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:49:23,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:23,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 4 times [2019-12-07 10:49:23,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:49:23,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41279092] [2019-12-07 10:49:23,190 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:23,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:49:23,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:49:23,318 WARN L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 10:49:23,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:24,355 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:48,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41279092] [2019-12-07 10:49:48,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:49:48,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-12-07 10:49:48,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186163602] [2019-12-07 10:49:48,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 10:49:48,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:49:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 10:49:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:49:48,750 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 36 states. [2019-12-07 10:49:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:50,475 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 10:49:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:49:50,476 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 21 [2019-12-07 10:49:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:50,476 INFO L225 Difference]: With dead ends: 36 [2019-12-07 10:49:50,476 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:49:50,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:49:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:49:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:49:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:49:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:49:50,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-12-07 10:49:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:50,478 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:49:50,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 10:49:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:49:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:49:50,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:49:50,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:49:50,786 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 304 [2019-12-07 10:49:52,010 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 304 DAG size of output: 237 [2019-12-07 10:49:52,014 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:49:52,014 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-12-07 10:49:52,015 INFO L249 CegarLoopResult]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-12-07 10:49:52,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:49:52,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:49:52,015 INFO L242 CegarLoopResult]: At program point L30-2(lines 30 33) the Hoare annotation is: (let ((.cse9 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse10 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (let ((.cse7 (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse9 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse10 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse9 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse10 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse9 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse10 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse9 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse10 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse9 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse10 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse4 (bvor (bvor .cse7 (bvor (bvshl (bvand .cse9 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse10 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse9 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse10 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse14 (bvor (bvor (bvor .cse4 (bvor (bvshl (bvand .cse9 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse10 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse9 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse10 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse9 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse10 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse5 (bvor .cse14 (bvor (bvshl (bvand .cse9 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv11 32)))))) (let ((.cse16 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse11 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967294 32))) (.cse3 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967293 32))) (.cse6 (bvor (bvor (bvor .cse5 (bvor (bvshl (bvand .cse9 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse9 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse9 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv14 32)))))) (let ((.cse8 (bvor .cse6 (bvor (bvshl (bvand .cse9 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv15 32))))) (.cse0 (let ((.cse18 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse9 .cse18) .cse3) (bvshl (bvand .cse10 .cse18) .cse11)))) (.cse1 (let ((.cse17 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse9 .cse17) .cse11) (bvshl (bvand .cse10 .cse17) .cse16)))) (.cse2 (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse9 .cse15) .cse16) (bvshl (bvand .cse10 .cse15) ULTIMATE.start_main_~i~0))))) (or (and (= (bvor (bvor (bvor (_ bv0 32) .cse0) .cse1) .cse2) ULTIMATE.start_main_~z~0) (= .cse3 (_ bv0 32))) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvor .cse4 .cse2) ULTIMATE.start_main_~z~0)) (and (= (bvor .cse5 .cse2) ULTIMATE.start_main_~z~0) (= (_ bv12 32) ULTIMATE.start_main_~i~0)) (and (= .cse6 ULTIMATE.start_main_~z~0) (= (_ bv14 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv11 32) ULTIMATE.start_main_~i~0) (= .cse5 ULTIMATE.start_main_~z~0)) (and (= (bvor (_ bv0 32) .cse2) ULTIMATE.start_main_~z~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv0 32) (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967290 32))) (= (bvor .cse7 .cse2) ULTIMATE.start_main_~z~0)) (and (= (_ bv9 32) ULTIMATE.start_main_~i~0) (= (bvor (bvor .cse4 .cse1) .cse2) ULTIMATE.start_main_~z~0)) (and (= .cse8 ULTIMATE.start_main_~z~0) (= (_ bv15 32) ULTIMATE.start_main_~i~0)) (and (= (bvor (bvor .cse5 .cse1) .cse2) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967283 32)) (_ bv0 32))) (= ULTIMATE.start_main_~z~0 (bvor .cse8 (bvor (bvshl (bvand .cse9 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv16 32))))) (and (= .cse11 (_ bv0 32)) (= (bvor (bvor (_ bv0 32) .cse1) .cse2) ULTIMATE.start_main_~z~0)) (and (= .cse4 ULTIMATE.start_main_~z~0) (= (_ bv7 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv0 32) (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967291 32))) (= .cse7 ULTIMATE.start_main_~z~0)) (and (= (bvor (bvor (bvor (bvor (_ bv0 32) (let ((.cse13 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32)))) (let ((.cse12 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse9 .cse12) .cse13) (bvshl (bvand .cse10 .cse12) .cse3))))) .cse0) .cse1) .cse2) ULTIMATE.start_main_~z~0) (= (_ bv4 32) ULTIMATE.start_main_~i~0)) (and (= .cse14 ULTIMATE.start_main_~z~0) (= (_ bv10 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~z~0)))))))))) [2019-12-07 10:49:52,015 INFO L246 CegarLoopResult]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2019-12-07 10:49:52,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-12-07 10:49:52,015 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-12-07 10:49:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:49:52 BoogieIcfgContainer [2019-12-07 10:49:52,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:49:52,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:49:52,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:49:52,054 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:49:52,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:15" (3/4) ... [2019-12-07 10:49:52,057 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:49:52,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:49:52,067 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:49:52,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e36b004-6be0-49d1-a867-09badc6ee4c8/bin/uautomizer/witness.graphml [2019-12-07 10:49:52,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:49:52,110 INFO L168 Benchmark]: Toolchain (without parser) took 36768.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 952.4 MB in the beginning and 1.3 GB in the end (delta: -309.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:52,110 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:49:52,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,111 INFO L168 Benchmark]: Boogie Preprocessor took 14.69 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,111 INFO L168 Benchmark]: RCFGBuilder took 156.03 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: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,112 INFO L168 Benchmark]: TraceAbstraction took 36321.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.5 MB). Peak memory consumption was 450.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,112 INFO L168 Benchmark]: Witness Printer took 55.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:49:52,114 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.75 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.69 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.03 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: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36321.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.5 MB). Peak memory consumption was 450.3 MB. Max. memory is 11.5 GB. * Witness Printer took 55.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967293bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967294bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967293bv32) == 0bv32) || (~bvadd64(i, 4294967288bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 12bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))) == z && 14bv32 == i)) || (11bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) == z)) || (~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 1bv32 == i)) || (0bv32 == ~bvadd64(i, 4294967290bv32) && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (9bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))) == z && 15bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967283bv32) == 0bv32)) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32)))) || (~bvadd64(i, 4294967294bv32) == 0bv32 && ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))) == z && 7bv32 == i)) || (0bv32 == ~bvadd64(i, 4294967291bv32) && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967292bv32))), ~bvadd64(i, 4294967292bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967292bv32))), ~bvadd64(i, 4294967293bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967293bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967294bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 4bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))) == z && 10bv32 == i)) || (0bv32 == i && 0bv32 == z) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Result: SAFE, OverallTime: 34.9s, OverallIterations: 5, TraceHistogramMax: 16, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 24 SDtfs, 60 SDslu, 67 SDs, 0 SdLazy, 577 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 31.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 33 NumberOfFragments, 2219 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3445 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 264 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 192088 SizeOfPredicates, 14 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 120/530 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...