./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_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan --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 Taipan --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_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan --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 Taipan --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 15:57:27,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:57:27,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:57:27,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:57:27,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:57:27,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:57:27,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:57:27,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:57:27,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:57:27,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:57:27,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:57:27,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:57:27,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:57:27,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:57:27,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:57:27,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:57:27,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:57:27,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:57:27,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:57:27,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:57:27,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:57:27,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:57:27,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:57:27,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:57:27,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:57:27,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:57:27,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:57:27,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:57:27,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:57:27,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:57:27,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:57:27,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:57:27,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:57:27,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:57:27,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:57:27,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:57:27,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:57:27,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:57:27,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:57:27,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:57:27,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:57:27,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:57:27,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:57:27,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:57:27,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:57:27,336 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:57:27,336 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:57:27,336 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:57:27,336 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:57:27,336 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:57:27,336 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:57:27,337 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:57:27,337 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:57:27,337 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:57:27,337 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:57:27,337 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:57:27,337 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:57:27,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:57:27,338 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:57:27,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:57:27,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:57:27,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:57:27,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:57:27,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:57:27,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:57:27,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:57:27,340 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:57:27,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:57:27,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:57:27,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:57:27,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:57:27,341 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan 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 -> Taipan 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 15:57:27,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:57:27,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:57:27,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:57:27,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:57:27,459 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:57:27,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 15:57:27,499 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/bfdcf17a1/68ec95cf77e14d69b77d60d5f5af5f45/FLAG37a47eed1 [2019-12-07 15:57:27,962 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:57:27,963 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 15:57:27,967 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/bfdcf17a1/68ec95cf77e14d69b77d60d5f5af5f45/FLAG37a47eed1 [2019-12-07 15:57:27,976 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/bfdcf17a1/68ec95cf77e14d69b77d60d5f5af5f45 [2019-12-07 15:57:27,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:57:27,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:57:27,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:57:27,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:57:27,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:57:27,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:57:27" (1/1) ... [2019-12-07 15:57:27,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1d1bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:27, skipping insertion in model container [2019-12-07 15:57:27,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:57:27" (1/1) ... [2019-12-07 15:57:27,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:57:28,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:57:28,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:57:28,138 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:57:28,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:57:28,163 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:57:28,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28 WrapperNode [2019-12-07 15:57:28,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:57:28,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:57:28,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:57:28,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:57:28,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:57:28,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:57:28,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:57:28,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:57:28,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... [2019-12-07 15:57:28,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:57:28,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:57:28,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:57:28,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:57:28,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:57:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:57:28,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:57:28,347 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:57:28,348 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:57:28,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:28 BoogieIcfgContainer [2019-12-07 15:57:28,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:57:28,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:57:28,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:57:28,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:57:28,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:57:27" (1/3) ... [2019-12-07 15:57:28,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523423cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:57:28, skipping insertion in model container [2019-12-07 15:57:28,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:28" (2/3) ... [2019-12-07 15:57:28,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523423cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:57:28, skipping insertion in model container [2019-12-07 15:57:28,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:28" (3/3) ... [2019-12-07 15:57:28,355 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-12-07 15:57:28,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:57:28,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:57:28,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:57:28,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:57:28,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:57:28,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:57:28,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:57:28,388 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:57:28,388 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:57:28,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:57:28,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:57:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-12-07 15:57:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 15:57:28,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:28,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 15:57:28,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 982688, now seen corresponding path program 1 times [2019-12-07 15:57:28,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:57:28,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574170187] [2019-12-07 15:57:28,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:57:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:28,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574170187] [2019-12-07 15:57:28,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:57:28,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:57:28,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660575475] [2019-12-07 15:57:28,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:57:28,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:57:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:57:28,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:57:28,544 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-12-07 15:57:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:28,561 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-12-07 15:57:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:57:28,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 15:57:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:28,568 INFO L225 Difference]: With dead ends: 13 [2019-12-07 15:57:28,568 INFO L226 Difference]: Without dead ends: 6 [2019-12-07 15:57:28,570 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 15:57:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-12-07 15:57:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-12-07 15:57:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 15:57:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-12-07 15:57:28,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-12-07 15:57:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:28,591 INFO L462 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-12-07 15:57:28,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:57:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-12-07 15:57:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:57:28,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:28,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:57:28,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29879958, now seen corresponding path program 1 times [2019-12-07 15:57:28,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:57:28,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834709877] [2019-12-07 15:57:28,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:57:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834709877] [2019-12-07 15:57:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129222385] [2019-12-07 15:57:28,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:28,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 15:57:28,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:28,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:28,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334604577] [2019-12-07 15:57:28,720 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 15:57:28,720 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:57:28,724 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 15:57:28,728 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 15:57:28,728 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 15:57:28,792 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 15:57:28,839 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:57:28,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:57:28,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-12-07 15:57:28,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288077250] [2019-12-07 15:57:28,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:57:28,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:57:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:57:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:57:28,841 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 7 states. [2019-12-07 15:57:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:28,871 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-12-07 15:57:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:57:28,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-12-07 15:57:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:28,872 INFO L225 Difference]: With dead ends: 12 [2019-12-07 15:57:28,872 INFO L226 Difference]: Without dead ends: 9 [2019-12-07 15:57:28,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:57:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-12-07 15:57:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 15:57:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 15:57:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-12-07 15:57:28,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-12-07 15:57:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:28,875 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-12-07 15:57:28,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:57:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-12-07 15:57:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:57:28,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:28,876 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-12-07 15:57:29,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:29,077 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 516312096, now seen corresponding path program 2 times [2019-12-07 15:57:29,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:57:29,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97196722] [2019-12-07 15:57:29,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:57:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:29,289 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 15:57:29,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97196722] [2019-12-07 15:57:29,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467308447] [2019-12-07 15:57:29,289 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:29,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 15:57:29,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:29,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:57:29,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:29,328 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 15:57:29,328 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:29,397 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 15:57:29,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088398671] [2019-12-07 15:57:29,398 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 15:57:29,398 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:57:29,399 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 15:57:29,399 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 15:57:29,399 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 15:57:29,421 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 15:57:29,479 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:57:29,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:57:29,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2019-12-07 15:57:29,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128334750] [2019-12-07 15:57:29,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:57:29,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:57:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:57:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:57:29,480 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2019-12-07 15:57:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:29,755 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-12-07 15:57:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:57:29,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-12-07 15:57:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:29,756 INFO L225 Difference]: With dead ends: 18 [2019-12-07 15:57:29,756 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 15:57:29,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:57:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 15:57:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 15:57:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 15:57:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-12-07 15:57:29,760 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-12-07 15:57:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:29,760 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-12-07 15:57:29,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:57:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-12-07 15:57:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:57:29,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:29,761 INFO L410 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-12-07 15:57:29,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:29,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash 833493088, now seen corresponding path program 3 times [2019-12-07 15:57:29,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:57:29,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395946094] [2019-12-07 15:57:29,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:57:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:30,116 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 15:57:30,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395946094] [2019-12-07 15:57:30,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987282651] [2019-12-07 15:57:30,117 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:30,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:57:30,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:30,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 15:57:30,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:30,165 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 15:57:30,165 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:30,399 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 15:57:30,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558696928] [2019-12-07 15:57:30,400 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 15:57:30,401 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:57:30,401 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 15:57:30,401 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 15:57:30,401 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 15:57:30,423 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 15:57:30,525 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:57:30,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:57:30,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2019-12-07 15:57:30,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916140816] [2019-12-07 15:57:30,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 15:57:30,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:57:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 15:57:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:57:30,527 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 25 states. [2019-12-07 15:57:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:31,388 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-12-07 15:57:31,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:57:31,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 14 [2019-12-07 15:57:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:31,389 INFO L225 Difference]: With dead ends: 24 [2019-12-07 15:57:31,389 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 15:57:31,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:57:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 15:57:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 15:57:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 15:57:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-12-07 15:57:31,394 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-12-07 15:57:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:31,394 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-12-07 15:57:31,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 15:57:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-12-07 15:57:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:57:31,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:31,395 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-12-07 15:57:31,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:31,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash -333728608, now seen corresponding path program 4 times [2019-12-07 15:57:31,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:57:31,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915349737] [2019-12-07 15:57:31,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:57:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:57:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:57:31,641 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:57:31,641 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:57:31,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:57:31 BoogieIcfgContainer [2019-12-07 15:57:31,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:57:31,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:57:31,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:57:31,657 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:57:31,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:28" (3/4) ... [2019-12-07 15:57:31,660 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:57:31,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:57:31,661 INFO L168 Benchmark]: Toolchain (without parser) took 3682.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:57:31,662 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:57:31,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:57:31,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:57:31,663 INFO L168 Benchmark]: Boogie Preprocessor took 13.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:57:31,663 INFO L168 Benchmark]: RCFGBuilder took 150.19 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.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:57:31,664 INFO L168 Benchmark]: TraceAbstraction took 3307.10 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: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:57:31,664 INFO L168 Benchmark]: Witness Printer took 3.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:57:31,666 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 150.19 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.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3307.10 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: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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, 7 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 16, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 42 SDs, 0 SdLazy, 183 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 4125 SizeOfPredicates, 3 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/198 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 15:57:33,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:57:33,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:57:33,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:57:33,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:57:33,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:57:33,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:57:33,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:57:33,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:57:33,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:57:33,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:57:33,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:57:33,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:57:33,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:57:33,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:57:33,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:57:33,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:57:33,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:57:33,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:57:33,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:57:33,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:57:33,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:57:33,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:57:33,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:57:33,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:57:33,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:57:33,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:57:33,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:57:33,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:57:33,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:57:33,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:57:33,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:57:33,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:57:33,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:57:33,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:57:33,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:57:33,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:57:33,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:57:33,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:57:33,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:57:33,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:57:33,049 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 15:57:33,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:57:33,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:57:33,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:57:33,060 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:57:33,061 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:57:33,061 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:57:33,061 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:57:33,061 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:57:33,061 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:57:33,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:57:33,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:57:33,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:57:33,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:57:33,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:57:33,064 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 15:57:33,065 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 15:57:33,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:57:33,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:57:33,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:57:33,065 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_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan 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 -> Taipan 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 15:57:33,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:57:33,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:57:33,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:57:33,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:57:33,247 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:57:33,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 15:57:33,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/47a201026/91f9838750ff4ad89e609c2f6f436a4a/FLAGdacb79456 [2019-12-07 15:57:33,613 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:57:33,614 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/sv-benchmarks/c/bitvector/interleave_bits.i [2019-12-07 15:57:33,618 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/47a201026/91f9838750ff4ad89e609c2f6f436a4a/FLAGdacb79456 [2019-12-07 15:57:33,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/data/47a201026/91f9838750ff4ad89e609c2f6f436a4a [2019-12-07 15:57:33,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:57:33,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:57:33,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:57:33,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:57:33,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:57:33,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203973a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33, skipping insertion in model container [2019-12-07 15:57:33,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:57:33,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:57:33,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:57:33,771 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:57:33,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:57:33,795 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:57:33,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33 WrapperNode [2019-12-07 15:57:33,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:57:33,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:57:33,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:57:33,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:57:33,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:57:33,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:57:33,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:57:33,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:57:33,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... [2019-12-07 15:57:33,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:57:33,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:57:33,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:57:33,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:57:33,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:57:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:57:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:57:34,032 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:57:34,032 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:57:34,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:34 BoogieIcfgContainer [2019-12-07 15:57:34,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:57:34,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:57:34,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:57:34,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:57:34,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:57:33" (1/3) ... [2019-12-07 15:57:34,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb1cc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:57:34, skipping insertion in model container [2019-12-07 15:57:34,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:57:33" (2/3) ... [2019-12-07 15:57:34,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb1cc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:57:34, skipping insertion in model container [2019-12-07 15:57:34,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:34" (3/3) ... [2019-12-07 15:57:34,038 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-12-07 15:57:34,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:57:34,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:57:34,055 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:57:34,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:57:34,070 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:57:34,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:57:34,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:57:34,071 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:57:34,071 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:57:34,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:57:34,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:57:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-12-07 15:57:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:57:34,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:34,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:57:34,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-12-07 15:57:34,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:57:34,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382517168] [2019-12-07 15:57:34,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:57:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:34,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:57:34,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:34,148 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:57:34,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382517168] [2019-12-07 15:57:34,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:57:34,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 15:57:34,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543018951] [2019-12-07 15:57:34,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:57:34,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:57:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:57:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:57:34,174 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-12-07 15:57:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:34,199 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-12-07 15:57:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:57:34,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 15:57:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:34,207 INFO L225 Difference]: With dead ends: 18 [2019-12-07 15:57:34,207 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 15:57:34,209 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 15:57:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 15:57:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 15:57:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 15:57:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-12-07 15:57:34,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-12-07 15:57:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:34,237 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-12-07 15:57:34,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:57:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-12-07 15:57:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:57:34,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:34,238 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 15:57:34,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 15:57:34,440 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:34,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2019-12-07 15:57:34,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:57:34,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236810196] [2019-12-07 15:57:34,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:57:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:34,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:57:34,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:34,529 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 15:57:34,529 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:34,570 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 15:57:34,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236810196] [2019-12-07 15:57:34,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1769533498] [2019-12-07 15:57:34,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:57:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:34,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:57:34,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:34,632 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 15:57:34,632 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:34,634 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 15:57:34,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746071028] [2019-12-07 15:57:34,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:57:34,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 15:57:34,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:34,689 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 15:57:34,689 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:34,760 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 15:57:34,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:57:34,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 9 [2019-12-07 15:57:34,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551422325] [2019-12-07 15:57:34,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:57:34,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:57:34,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:57:34,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:57:34,763 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-12-07 15:57:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:34,904 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-12-07 15:57:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:57:34,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-12-07 15:57:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:34,905 INFO L225 Difference]: With dead ends: 16 [2019-12-07 15:57:34,905 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 15:57:34,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:57:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 15:57:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 15:57:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 15:57:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-12-07 15:57:34,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-12-07 15:57:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:34,910 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-12-07 15:57:34,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:57:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-12-07 15:57:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:57:34,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:34,911 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-12-07 15:57:35,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,3 mathsat -unsat_core_generation=3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:35,513 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 2 times [2019-12-07 15:57:35,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:57:35,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795629069] [2019-12-07 15:57:35,516 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:57:35,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:57:35,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:35,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:57:35,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:35,609 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 15:57:35,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:35,800 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 15:57:35,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795629069] [2019-12-07 15:57:35,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905597844] [2019-12-07 15:57:35,801 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:57:35,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:57:35,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:35,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:57:35,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:35,906 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 15:57:35,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:35,909 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 15:57:35,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756545208] [2019-12-07 15:57:35,910 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:57:35,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:57:35,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:35,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 15:57:35,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:35,979 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 15:57:35,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:36,360 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 15:57:36,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:57:36,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 21 [2019-12-07 15:57:36,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459932874] [2019-12-07 15:57:36,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 15:57:36,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:57:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 15:57:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2019-12-07 15:57:36,362 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2019-12-07 15:57:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:37,134 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-12-07 15:57:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 15:57:37,135 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2019-12-07 15:57:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:37,135 INFO L225 Difference]: With dead ends: 24 [2019-12-07 15:57:37,135 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 15:57:37,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:57:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 15:57:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 15:57:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 15:57:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-12-07 15:57:37,140 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2019-12-07 15:57:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:37,140 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-12-07 15:57:37,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 15:57:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-12-07 15:57:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:57:37,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:37,141 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-12-07 15:57:37,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:37,743 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 3 times [2019-12-07 15:57:37,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:57:37,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818407811] [2019-12-07 15:57:37,746 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 15:57:37,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 15:57:37,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:37,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:57:37,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:37,986 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 15:57:37,986 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:39,053 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 15:57:39,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818407811] [2019-12-07 15:57:39,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [428810784] [2019-12-07 15:57:39,054 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:57:39,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 15:57:39,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:39,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:57:39,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:39,279 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 15:57:39,279 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:39,287 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 15:57:39,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539391857] [2019-12-07 15:57:39,287 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:57:39,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 15:57:39,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:39,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:57:39,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:39,372 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 15:57:39,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:57:39,378 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 15:57:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:57:39,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16, 16] total 31 [2019-12-07 15:57:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877983573] [2019-12-07 15:57:39,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 15:57:39,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:57:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 15:57:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:57:39,381 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2019-12-07 15:57:39,861 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 15:57:40,251 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 15:57:40,721 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 15:57:40,991 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2019-12-07 15:57:41,293 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2019-12-07 15:57:41,579 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-12-07 15:57:41,864 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2019-12-07 15:57:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:57:43,431 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2019-12-07 15:57:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 15:57:43,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-12-07 15:57:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:57:43,433 INFO L225 Difference]: With dead ends: 40 [2019-12-07 15:57:43,433 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 15:57:43,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=622, Invalid=1540, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 15:57:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 15:57:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 15:57:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 15:57:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-12-07 15:57:43,439 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2019-12-07 15:57:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:57:43,439 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-12-07 15:57:43,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 15:57:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-12-07 15:57:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:57:43,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:57:43,440 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-12-07 15:57:44,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:57:44,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:57:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:57:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 4 times [2019-12-07 15:57:44,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:57:44,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654333585] [2019-12-07 15:57:44,045 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 15:57:44,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:57:44,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:57:44,164 WARN L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:57:44,166 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:57:45,305 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 15:57:45,306 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:58:10,140 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 15:58:10,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654333585] [2019-12-07 15:58:10,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [203267025] [2019-12-07 15:58:10,141 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:58:10,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:58:10,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:58:10,337 WARN L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 15:58:10,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:10,824 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 15:58:10,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:58:11,278 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 15:58:11,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817232380] [2019-12-07 15:58:11,279 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/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 15:58:11,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:58:11,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:58:11,354 WARN L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 15:58:11,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:12,280 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 15:58:12,280 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:58:16,483 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 167 [2019-12-07 15:58:17,635 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 175 [2019-12-07 15:58:18,901 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2019-12-07 15:58:20,301 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 191 [2019-12-07 15:58:21,849 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 199 [2019-12-07 15:58:23,489 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 207 [2019-12-07 15:58:25,287 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 215 [2019-12-07 15:58:27,261 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 223 [2019-12-07 15:58:29,415 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 231 [2019-12-07 15:58:31,762 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 239 [2019-12-07 15:58:34,255 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 247 [2019-12-07 15:58:36,998 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 255 [2019-12-07 15:58:39,267 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2019-12-07 15:58:39,292 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 15:58:39,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:58:39,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 20, 20] total 53 [2019-12-07 15:58:39,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004659963] [2019-12-07 15:58:39,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 15:58:39,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:58:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 15:58:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=1969, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 15:58:39,295 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 54 states. [2019-12-07 15:58:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:41,396 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-12-07 15:58:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:58:41,396 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 21 [2019-12-07 15:58:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:41,396 INFO L225 Difference]: With dead ends: 38 [2019-12-07 15:58:41,396 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:58:41,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 29 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=931, Invalid=2039, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 15:58:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:58:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:58:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:58:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:58:41,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-12-07 15:58:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:41,398 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:58:41,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 15:58:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:58:41,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:58:41,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 15:58:42,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:58:42,108 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 313 [2019-12-07 15:58:44,011 WARN L192 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 313 DAG size of output: 242 [2019-12-07 15:58:44,014 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:58:44,014 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-12-07 15:58:44,014 INFO L249 CegarLoopResult]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-12-07 15:58:44,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:58:44,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:58:44,015 INFO L242 CegarLoopResult]: At program point L30-2(lines 30 33) the Hoare annotation is: (let ((.cse3 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse6 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (let ((.cse16 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse3 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse6 (_ bv1 32)) (_ bv1 32)))))) (let ((.cse13 (bvor .cse16 (bvor (bvshl (bvand .cse3 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse6 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse14 (bvor .cse13 (bvor (bvshl (bvand .cse3 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse18 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse12 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967294 32))) (.cse15 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967293 32))) (.cse2 (bvor (bvor .cse14 (bvor (bvshl (bvand .cse3 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse3 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse6 (_ bv16 32)) (_ bv5 32))))) (.cse22 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32))) (.cse7 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967291 32)))) (let ((.cse5 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967290 32))) (.cse8 (let ((.cse23 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse3 .cse23) .cse7) (bvshl (bvand .cse6 .cse23) .cse22)))) (.cse0 (bvor (bvor (bvor (bvor (bvor (bvor (bvor .cse2 (bvor (bvshl (bvand .cse3 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse3 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse3 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse6 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse3 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse6 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse3 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse6 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse3 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse6 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse3 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse6 (_ bv2048 32)) (_ bv12 32))))) (.cse9 (let ((.cse21 (bvshl (_ bv1 32) .cse22))) (bvor (bvshl (bvand .cse3 .cse21) .cse22) (bvshl (bvand .cse6 .cse21) .cse15)))) (.cse10 (let ((.cse20 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse3 .cse20) .cse15) (bvshl (bvand .cse6 .cse20) .cse12)))) (.cse11 (let ((.cse19 (bvshl (_ bv1 32) .cse12))) (bvor (bvshl (bvand .cse3 .cse19) .cse12) (bvshl (bvand .cse6 .cse19) .cse18)))) (.cse1 (let ((.cse17 (bvshl (_ bv1 32) .cse18))) (bvor (bvshl (bvand .cse3 .cse17) .cse18) (bvshl (bvand .cse6 .cse17) ULTIMATE.start_main_~i~0))))) (or (and (= (bvor .cse0 .cse1) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967283 32)) (_ bv0 32))) (and (= (_ bv11 32) ULTIMATE.start_main_~i~0) (= (bvor (bvor (bvor (bvor (bvor (bvor .cse2 (let ((.cse4 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse3 .cse4) .cse5) (bvshl (bvand .cse6 .cse4) .cse7)))) .cse8) .cse9) .cse10) .cse11) .cse1) ULTIMATE.start_main_~z~0)) (and (= (bvor (bvor .cse0 .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (_ bv14 32) ULTIMATE.start_main_~i~0)) (and (= .cse0 ULTIMATE.start_main_~z~0) (= (_ bv12 32) ULTIMATE.start_main_~i~0)) (and (= .cse12 (_ bv0 32)) (= .cse13 ULTIMATE.start_main_~z~0)) (and (= (bvor (bvor (bvor (bvor .cse2 .cse9) .cse10) .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (_ bv9 32) ULTIMATE.start_main_~i~0)) (and (= (bvor .cse14 .cse1) ULTIMATE.start_main_~z~0) (= (_ bv4 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv0 32) .cse5) (= (bvor .cse2 .cse1) ULTIMATE.start_main_~z~0)) (and (= (bvor (bvor (bvor (bvor (bvor .cse2 .cse8) .cse9) .cse10) .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (_ bv0 32) (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967286 32)))) (and (= .cse14 ULTIMATE.start_main_~z~0) (= .cse15 (_ bv0 32))) (and (= (bvor (bvor .cse2 .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= (bvor (bvor (bvor .cse0 .cse10) .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967281 32)) (_ bv0 32))) (and (= (bvor (bvor (bvor .cse2 .cse10) .cse11) .cse1) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967288 32)) (_ bv0 32))) (and (= .cse16 ULTIMATE.start_main_~z~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0)) (and (= ULTIMATE.start_main_~z~0 (bvor (bvor (bvor (bvor .cse0 .cse9) .cse10) .cse11) .cse1)) (= (_ bv16 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv0 32) .cse7) (= .cse2 ULTIMATE.start_main_~z~0)) (and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~z~0))))))))) [2019-12-07 15:58:44,015 INFO L246 CegarLoopResult]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2019-12-07 15:58:44,015 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-12-07 15:58:44,015 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-12-07 15:58:44,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:58:44 BoogieIcfgContainer [2019-12-07 15:58:44,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:58:44,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:58:44,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:58:44,054 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:58:44,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:57:34" (3/4) ... [2019-12-07 15:58:44,057 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:58:44,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 15:58:44,067 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:58:44,111 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc504f75-7cef-4068-8654-100bc49d6337/bin/utaipan/witness.graphml [2019-12-07 15:58:44,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:58:44,112 INFO L168 Benchmark]: Toolchain (without parser) took 70479.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 245.4 MB). Free memory was 952.4 MB in the beginning and 807.2 MB in the end (delta: 145.2 MB). Peak memory consumption was 390.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,113 INFO L168 Benchmark]: CDTParser took 0.13 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 15:58:44,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.29 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 15:58:44,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,114 INFO L168 Benchmark]: Boogie Preprocessor took 14.92 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,114 INFO L168 Benchmark]: RCFGBuilder took 166.62 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.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,114 INFO L168 Benchmark]: TraceAbstraction took 70019.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 816.1 MB in the end (delta: 291.7 MB). Peak memory consumption was 405.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,115 INFO L168 Benchmark]: Witness Printer took 57.63 ms. Allocated memory is still 1.3 GB. Free memory was 816.1 MB in the beginning and 807.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:44,116 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.13 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 161.29 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 55.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.92 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.62 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.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70019.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 816.1 MB in the end (delta: 291.7 MB). Peak memory consumption was 405.5 MB. Max. memory is 11.5 GB. * Witness Printer took 57.63 ms. Allocated memory is still 1.3 GB. Free memory was 816.1 MB in the beginning and 807.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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(~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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967283bv32) == 0bv32) || (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), ~bvshl32(1bv32, ~bvadd64(i, 4294967290bv32))), ~bvadd64(i, 4294967290bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967290bv32))), ~bvadd64(i, 4294967291bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967291bv32))), ~bvadd64(i, 4294967291bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967291bv32))), ~bvadd64(i, 4294967292bv32)))), ~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)) || (~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), ~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 && 14bv32 == i)) || (~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))) == z && 12bv32 == i)) || (~bvadd64(i, 4294967294bv32) == 0bv32 && ~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))) == z)) || (~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), ~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 && 9bv32 == i)) || (~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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 4bv32 == 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)) || (~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), ~bvshl32(1bv32, ~bvadd64(i, 4294967291bv32))), ~bvadd64(i, 4294967291bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967291bv32))), ~bvadd64(i, 4294967292bv32)))), ~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 && 0bv32 == ~bvadd64(i, 4294967286bv32))) || (~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))) == z && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (~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), ~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, 4294967289bv32) == 0bv32)) || (~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), ~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, 4294967281bv32) == 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), ~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, 4294967288bv32) == 0bv32)) || (~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))) == z && 1bv32 == i)) || (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), ~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))) && 16bv32 == 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)) || (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: 67.9s, OverallIterations: 5, TraceHistogramMax: 16, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 23 SDtfs, 86 SDslu, 74 SDs, 0 SdLazy, 586 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 174 SyntacticMatches, 46 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 61.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, 20 NumberOfFragments, 2405 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 421 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 332 ConstructedInterpolants, 1 QuantifiedInterpolants, 602196 SizeOfPredicates, 41 NumberOfNonLiveVariables, 524 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 240/1590 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...