./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 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:55:07,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:55:07,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:55:07,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:55:07,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:55:07,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:55:07,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:55:07,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:55:07,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:55:07,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:55:07,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:55:07,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:55:07,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:55:07,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:55:07,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:55:07,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:55:07,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:55:07,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:55:07,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:55:07,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:55:07,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:55:07,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:55:07,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:55:07,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:55:07,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:55:07,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:55:07,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:55:07,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:55:07,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:55:07,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:55:07,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:55:07,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:55:07,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:55:07,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:55:07,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:55:07,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:55:07,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:55:07,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:55:07,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:55:07,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:55:07,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:55:07,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:55:07,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:55:07,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:55:07,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:55:07,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:55:07,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:55:07,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:55:07,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:55:07,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:55:07,734 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:55:07,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:55:07,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:55:07,737 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:55:07,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:55:07,737 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:55:07,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:55:07,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:55:07,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:55:07,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:55:07,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:55:07,739 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:55:07,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:55:07,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:55:07,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:55:07,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2021-12-15 08:55:07,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:55:07,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:55:07,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:55:07,913 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:55:07,913 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:55:07,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-15 08:55:07,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9227e7f37/d951558f76bb4f39b5f1a922cad2f396/FLAG9be60d2be [2021-12-15 08:55:08,324 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:55:08,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-15 08:55:08,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9227e7f37/d951558f76bb4f39b5f1a922cad2f396/FLAG9be60d2be [2021-12-15 08:55:08,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9227e7f37/d951558f76bb4f39b5f1a922cad2f396 [2021-12-15 08:55:08,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:55:08,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:55:08,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:55:08,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:55:08,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:55:08,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255e8dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08, skipping insertion in model container [2021-12-15 08:55:08,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:55:08,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:55:08,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-15 08:55:08,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:55:08,562 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:55:08,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-15 08:55:08,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:55:08,583 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:55:08,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08 WrapperNode [2021-12-15 08:55:08,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:55:08,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:55:08,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:55:08,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:55:08,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,610 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2021-12-15 08:55:08,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:55:08,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:55:08,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:55:08,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:55:08,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:55:08,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:55:08,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:55:08,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:55:08,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (1/1) ... [2021-12-15 08:55:08,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:55:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:55:08,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 08:55:08,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 08:55:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:55:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:55:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:55:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:55:08,730 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:55:08,731 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:55:08,828 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:55:08,832 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:55:08,833 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 08:55:08,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:08 BoogieIcfgContainer [2021-12-15 08:55:08,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:55:08,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:55:08,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:55:08,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:55:08,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:55:08" (1/3) ... [2021-12-15 08:55:08,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf4134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:08, skipping insertion in model container [2021-12-15 08:55:08,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:08" (2/3) ... [2021-12-15 08:55:08,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf4134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:08, skipping insertion in model container [2021-12-15 08:55:08,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:08" (3/3) ... [2021-12-15 08:55:08,861 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-12-15 08:55:08,864 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:55:08,865 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:55:08,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:55:08,917 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:55:08,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:55:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 08:55:08,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:08,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 08:55:08,936 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-15 08:55:08,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:55:08,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460514709] [2021-12-15 08:55:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:08,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:55:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:55:09,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460514709] [2021-12-15 08:55:09,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460514709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:55:09,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:55:09,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:55:09,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824810102] [2021-12-15 08:55:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:55:09,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:55:09,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:55:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:55:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:55:09,140 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:09,156 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-15 08:55:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:55:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 08:55:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:09,173 INFO L225 Difference]: With dead ends: 20 [2021-12-15 08:55:09,174 INFO L226 Difference]: Without dead ends: 8 [2021-12-15 08:55:09,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:55:09,181 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:09,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-15 08:55:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-15 08:55:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-15 08:55:09,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-15 08:55:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:09,218 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-15 08:55:09,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-15 08:55:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 08:55:09,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:09,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:09,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:55:09,219 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-15 08:55:09,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:55:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422466958] [2021-12-15 08:55:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:09,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:55:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:55:09,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422466958] [2021-12-15 08:55:09,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422466958] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:55:09,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461922515] [2021-12-15 08:55:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:09,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:55:09,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:55:09,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:55:09,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 08:55:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:09,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:55:09,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461922515] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:09,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:55:09,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 08:55:09,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569327959] [2021-12-15 08:55:09,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:09,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 08:55:09,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:55:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 08:55:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:55:09,409 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:09,446 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-15 08:55:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:55:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 08:55:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:09,447 INFO L225 Difference]: With dead ends: 15 [2021-12-15 08:55:09,447 INFO L226 Difference]: Without dead ends: 11 [2021-12-15 08:55:09,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-12-15 08:55:09,450 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:09,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-15 08:55:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-15 08:55:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-15 08:55:09,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-15 08:55:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:09,461 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-15 08:55:09,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-15 08:55:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 08:55:09,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:09,467 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:09,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 08:55:09,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:55:09,684 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-15 08:55:09,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:55:09,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565411713] [2021-12-15 08:55:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:09,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:55:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:55:09,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565411713] [2021-12-15 08:55:09,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565411713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:55:09,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918013384] [2021-12-15 08:55:09,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:55:09,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:55:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:55:09,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:55:09,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 08:55:09,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:55:09,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:55:09,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 08:55:09,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:09,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918013384] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:09,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:55:09,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-15 08:55:09,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379341081] [2021-12-15 08:55:09,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:09,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 08:55:09,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:55:09,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 08:55:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-15 08:55:09,991 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:10,172 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-12-15 08:55:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:55:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 08:55:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:10,173 INFO L225 Difference]: With dead ends: 21 [2021-12-15 08:55:10,173 INFO L226 Difference]: Without dead ends: 17 [2021-12-15 08:55:10,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:55:10,174 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:10,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-15 08:55:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-15 08:55:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-12-15 08:55:10,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-12-15 08:55:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:10,178 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-12-15 08:55:10,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-12-15 08:55:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 08:55:10,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:10,179 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:10,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 08:55:10,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-15 08:55:10,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-12-15 08:55:10,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:55:10,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786404051] [2021-12-15 08:55:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:10,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:55:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:10,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:55:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786404051] [2021-12-15 08:55:10,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786404051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:55:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30372023] [2021-12-15 08:55:10,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:55:10,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:55:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:55:10,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:55:10,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 08:55:10,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-15 08:55:10,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:55:10,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 08:55:10,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:10,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:11,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30372023] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:11,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:55:11,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-15 08:55:11,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53801578] [2021-12-15 08:55:11,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:11,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 08:55:11,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:55:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 08:55:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2021-12-15 08:55:11,028 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:11,327 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-12-15 08:55:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 08:55:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 08:55:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:11,330 INFO L225 Difference]: With dead ends: 27 [2021-12-15 08:55:11,330 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 08:55:11,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2021-12-15 08:55:11,331 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:11,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:55:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 08:55:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 08:55:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-12-15 08:55:11,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2021-12-15 08:55:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:11,334 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-12-15 08:55:11,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-12-15 08:55:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 08:55:11,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:11,335 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:11,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:11,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:55:11,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-12-15 08:55:11,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:55:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417414127] [2021-12-15 08:55:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:11,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:55:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:55:11,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 08:55:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:55:11,608 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 08:55:11,611 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 08:55:11,613 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 08:55:11,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 08:55:11,616 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2021-12-15 08:55:11,618 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 08:55:11,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:55:11 BoogieIcfgContainer [2021-12-15 08:55:11,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 08:55:11,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 08:55:11,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 08:55:11,634 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 08:55:11,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:08" (3/4) ... [2021-12-15 08:55:11,636 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 08:55:11,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 08:55:11,637 INFO L158 Benchmark]: Toolchain (without parser) took 3284.28ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 77.7MB in the beginning and 69.3MB in the end (delta: 8.5MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2021-12-15 08:55:11,637 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:11,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.90ms. Allocated memory is still 107.0MB. Free memory was 77.5MB in the beginning and 80.9MB in the end (delta: -3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 08:55:11,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.37ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:11,638 INFO L158 Benchmark]: Boogie Preprocessor took 12.88ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 08:55:11,638 INFO L158 Benchmark]: RCFGBuilder took 209.03ms. Allocated memory is still 107.0MB. Free memory was 78.3MB in the beginning and 70.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 08:55:11,638 INFO L158 Benchmark]: TraceAbstraction took 2777.91ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 69.5MB in the beginning and 69.3MB in the end (delta: 185.9kB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2021-12-15 08:55:11,638 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 146.8MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:11,640 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.90ms. Allocated memory is still 107.0MB. Free memory was 77.5MB in the beginning and 80.9MB in the end (delta: -3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.37ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.88ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 209.03ms. Allocated memory is still 107.0MB. Free memory was 78.3MB in the beginning and 70.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2777.91ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 69.5MB in the beginning and 69.3MB in the end (delta: 185.9kB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 146.8MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 55. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16] [L53] xx = x [L54] yy = y [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 28 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 39, 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, 1.0s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 3 NumberOfNonLiveVariables, 144 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, ACCELERATED_INTERPOLATION: 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 [2021-12-15 08:55:11,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:55:13,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:55:13,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:55:13,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:55:13,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:55:13,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:55:13,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:55:13,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:55:13,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:55:13,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:55:13,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:55:13,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:55:13,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:55:13,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:55:13,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:55:13,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:55:13,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:55:13,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:55:13,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:55:13,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:55:13,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:55:13,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:55:13,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:55:13,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:55:13,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:55:13,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:55:13,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:55:13,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:55:13,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:55:13,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:55:13,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:55:13,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:55:13,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:55:13,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:55:13,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:55:13,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:55:13,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:55:13,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:55:13,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:55:13,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:55:13,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:55:13,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 08:55:13,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:55:13,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:55:13,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:55:13,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:55:13,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:55:13,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:55:13,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:55:13,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:55:13,471 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:55:13,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:55:13,471 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 08:55:13,472 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:55:13,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:55:13,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:55:13,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:55:13,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:55:13,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:55:13,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:55:13,474 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 08:55:13,474 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 08:55:13,475 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2021-12-15 08:55:13,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:55:13,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:55:13,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:55:13,798 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:55:13,799 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:55:13,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-15 08:55:13,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa08851a/540722faa594431cbdc01ee011cd31db/FLAGbc67d7a97 [2021-12-15 08:55:14,328 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:55:14,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-15 08:55:14,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa08851a/540722faa594431cbdc01ee011cd31db/FLAGbc67d7a97 [2021-12-15 08:55:14,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa08851a/540722faa594431cbdc01ee011cd31db [2021-12-15 08:55:14,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:55:14,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:55:14,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:55:14,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:55:14,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:55:14,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:14" (1/1) ... [2021-12-15 08:55:14,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2006dd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:14, skipping insertion in model container [2021-12-15 08:55:14,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:14" (1/1) ... [2021-12-15 08:55:14,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:55:14,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:55:15,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-15 08:55:15,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:55:15,093 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:55:15,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-15 08:55:15,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:55:15,132 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:55:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15 WrapperNode [2021-12-15 08:55:15,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:55:15,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:55:15,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:55:15,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:55:15,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,163 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2021-12-15 08:55:15,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:55:15,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:55:15,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:55:15,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:55:15,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:55:15,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:55:15,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:55:15,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:55:15,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (1/1) ... [2021-12-15 08:55:15,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:55:15,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:55:15,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 08:55:15,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 08:55:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:55:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 08:55:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:55:15,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:55:15,357 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:55:15,359 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:55:15,447 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:55:15,451 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:55:15,451 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 08:55:15,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:15 BoogieIcfgContainer [2021-12-15 08:55:15,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:55:15,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:55:15,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:55:15,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:55:15,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:55:14" (1/3) ... [2021-12-15 08:55:15,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5aef27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:15, skipping insertion in model container [2021-12-15 08:55:15,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:15" (2/3) ... [2021-12-15 08:55:15,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5aef27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:15, skipping insertion in model container [2021-12-15 08:55:15,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:15" (3/3) ... [2021-12-15 08:55:15,458 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-12-15 08:55:15,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:55:15,463 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:55:15,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:55:15,522 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:55:15,523 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:55:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 08:55:15,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:15,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 08:55:15,535 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-15 08:55:15,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:15,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400756180] [2021-12-15 08:55:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:15,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:15,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:15,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 08:55:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:15,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 08:55:15,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:15,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:55:15,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:15,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400756180] [2021-12-15 08:55:15,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400756180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:55:15,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:55:15,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:55:15,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27963267] [2021-12-15 08:55:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:55:15,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:55:15,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:15,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:55:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:55:15,707 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:15,726 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-15 08:55:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:55:15,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 08:55:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:15,734 INFO L225 Difference]: With dead ends: 20 [2021-12-15 08:55:15,734 INFO L226 Difference]: Without dead ends: 8 [2021-12-15 08:55:15,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:55:15,738 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:15,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-15 08:55:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-15 08:55:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-15 08:55:15,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-15 08:55:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:15,759 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-15 08:55:15,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-15 08:55:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 08:55:15,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:15,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:15,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-15 08:55:15,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:15,966 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-15 08:55:15,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:15,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828703155] [2021-12-15 08:55:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:15,968 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:15,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 08:55:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:16,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 08:55:16,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:16,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:16,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:16,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828703155] [2021-12-15 08:55:16,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828703155] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:16,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:16,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-15 08:55:16,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317531778] [2021-12-15 08:55:16,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:16,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 08:55:16,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 08:55:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:55:16,077 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:16,117 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-15 08:55:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:55:16,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 08:55:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:16,118 INFO L225 Difference]: With dead ends: 15 [2021-12-15 08:55:16,119 INFO L226 Difference]: Without dead ends: 11 [2021-12-15 08:55:16,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:55:16,120 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:16,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-15 08:55:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-15 08:55:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-15 08:55:16,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-15 08:55:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:16,123 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-15 08:55:16,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-15 08:55:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 08:55:16,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:16,124 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:16,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-15 08:55:16,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:16,331 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-15 08:55:16,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229299868] [2021-12-15 08:55:16,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:55:16,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:16,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 08:55:16,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:55:16,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:55:16,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:55:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:16,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:16,519 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:16,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229299868] [2021-12-15 08:55:16,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229299868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:16,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:16,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-15 08:55:16,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403719557] [2021-12-15 08:55:16,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:16,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 08:55:16,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 08:55:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-15 08:55:16,521 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:16,628 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-12-15 08:55:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:55:16,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 08:55:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:16,629 INFO L225 Difference]: With dead ends: 21 [2021-12-15 08:55:16,629 INFO L226 Difference]: Without dead ends: 17 [2021-12-15 08:55:16,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2021-12-15 08:55:16,631 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:16,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:55:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-15 08:55:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-15 08:55:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-12-15 08:55:16,634 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-12-15 08:55:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:16,634 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-12-15 08:55:16,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-12-15 08:55:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 08:55:16,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:16,635 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:16,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:16,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:16,835 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-12-15 08:55:16,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:16,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334959730] [2021-12-15 08:55:16,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:55:16,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:16,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:16,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:16,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 08:55:16,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-15 08:55:16,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:55:16,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 08:55:16,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:17,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:17,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:17,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334959730] [2021-12-15 08:55:17,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334959730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:17,282 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:17,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-15 08:55:17,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430209694] [2021-12-15 08:55:17,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:17,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 08:55:17,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 08:55:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2021-12-15 08:55:17,284 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:18,168 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-15 08:55:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 08:55:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 08:55:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:18,170 INFO L225 Difference]: With dead ends: 33 [2021-12-15 08:55:18,170 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 08:55:18,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 08:55:18,171 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:18,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:55:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 08:55:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 08:55:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-12-15 08:55:18,179 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2021-12-15 08:55:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:18,179 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-15 08:55:18,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-12-15 08:55:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 08:55:18,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:18,181 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:18,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:18,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:18,388 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-12-15 08:55:18,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525145213] [2021-12-15 08:55:18,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:55:18,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:18,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:18,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:18,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 08:55:18,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:55:18,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:55:18,482 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 08:55:18,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:19,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:53,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~y~0#1| (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (= (let ((.cse31 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv15 32)))) (bvor (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv14 32)))) (bvor (let ((.cse27 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv13 32)))) (bvor (let ((.cse25 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv12 32)))) (bvor (let ((.cse23 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv11 32)))) (bvor (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv10 32)))) (bvor (let ((.cse19 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv9 32)))) (bvor (let ((.cse17 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv8 32)))) (bvor (let ((.cse15 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv7 32)))) (bvor (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv6 32)))) (bvor (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv5 32)))) (bvor (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (bvor (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (bvor (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (bvor (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse1 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse1) |c_ULTIMATE.start_main_~i~0#1|) (bvshl (bvand .cse2 .cse1) .cse3)))) (let ((.cse4 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse0 .cse4) .cse3) (bvshl (bvand .cse2 .cse4) .cse5))))) (let ((.cse6 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse0 .cse6) .cse5) (bvshl (bvand .cse2 .cse6) .cse7))))) (let ((.cse8 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse0 .cse8) .cse7) (bvshl (bvand .cse2 .cse8) .cse9))))) (let ((.cse10 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse0 .cse10) .cse9) (bvshl (bvand .cse2 .cse10) .cse11))))) (let ((.cse12 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse12) .cse11) (bvshl (bvand .cse2 .cse12) .cse13))))) (let ((.cse14 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse14) .cse13) (bvshl (bvand .cse2 .cse14) .cse15))))) (let ((.cse16 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse0 .cse16) .cse15) (bvshl (bvand .cse2 .cse16) .cse17))))) (let ((.cse18 (bvshl (_ bv1 32) .cse17))) (bvor (bvshl (bvand .cse0 .cse18) .cse17) (bvshl (bvand .cse2 .cse18) .cse19))))) (let ((.cse20 (bvshl (_ bv1 32) .cse19))) (bvor (bvshl (bvand .cse0 .cse20) .cse19) (bvshl (bvand .cse2 .cse20) .cse21))))) (let ((.cse22 (bvshl (_ bv1 32) .cse21))) (bvor (bvshl (bvand .cse0 .cse22) .cse21) (bvshl (bvand .cse2 .cse22) .cse23))))) (let ((.cse24 (bvshl (_ bv1 32) .cse23))) (bvor (bvshl (bvand .cse0 .cse24) .cse23) (bvshl (bvand .cse2 .cse24) .cse25))))) (let ((.cse26 (bvshl (_ bv1 32) .cse25))) (bvor (bvshl (bvand .cse0 .cse26) .cse25) (bvshl (bvand .cse2 .cse26) .cse27))))) (let ((.cse28 (bvshl (_ bv1 32) .cse27))) (bvor (bvshl (bvand .cse0 .cse28) .cse27) (bvshl (bvand .cse2 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse0 .cse30) .cse29) (bvshl (bvand .cse2 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse0 .cse32) .cse31) (bvshl (bvand .cse2 .cse32) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv16 32))))))) (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse2 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse0 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse2 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse2 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse2 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse0 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse2 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse2 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse2 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse2 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse0 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse2 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse0 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse2 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse2 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse2 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse2 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse2 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse2 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse2 (_ bv32768 32)) (_ bv16 32))))))) is different from false [2021-12-15 08:55:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-15 08:55:53,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:53,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525145213] [2021-12-15 08:55:53,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525145213] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:53,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:53,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-12-15 08:55:53,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391213174] [2021-12-15 08:55:53,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:53,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 08:55:53,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:53,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 08:55:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2021-12-15 08:55:53,450 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:55,191 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-15 08:55:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 08:55:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 08:55:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:55,191 INFO L225 Difference]: With dead ends: 29 [2021-12-15 08:55:55,191 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 08:55:55,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2021-12-15 08:55:55,192 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:55,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.6s Time] [2021-12-15 08:55:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 08:55:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 08:55:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 08:55:55,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-12-15 08:55:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:55,193 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 08:55:55,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:55:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 08:55:55,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 08:55:55,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 08:55:55,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:55,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:55,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 08:55:56,089 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-15 08:55:56,089 INFO L858 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2021-12-15 08:55:56,089 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2021-12-15 08:55:56,089 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-15 08:55:56,089 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-15 08:55:56,090 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-15 08:55:56,090 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2021-12-15 08:55:56,090 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2021-12-15 08:55:56,090 INFO L861 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2021-12-15 08:55:56,090 INFO L854 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse10 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse5 (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse7 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse10 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse7 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse10 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse13 (bvor .cse5 (bvor (bvshl (bvand .cse7 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse10 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse1 (bvor (bvor .cse13 (bvor (bvshl (bvand .cse7 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse10 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse7 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse10 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse4 (bvor (bvor (bvor .cse1 (bvor (bvshl (bvand .cse7 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse10 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse7 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse10 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse7 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse10 (_ bv128 32)) (_ bv8 32)))))) (let ((.cse6 (bvor .cse4 (bvor (bvshl (bvand .cse7 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse10 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse15 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967295 32))) (.cse11 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32))) (.cse3 (bvor (bvor (bvor (bvor .cse6 (bvor (bvshl (bvand .cse7 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse10 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse7 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse7 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse7 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse12 (bvor (bvor .cse3 (bvor (bvshl (bvand .cse7 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse7 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv15 32))))) (.cse2 (let ((.cse16 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse7 .cse16) .cse11) (bvshl (bvand .cse10 .cse16) .cse15)))) (.cse0 (let ((.cse14 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse7 .cse14) .cse15) (bvshl (bvand .cse10 .cse14) |ULTIMATE.start_main_~i~0#1|))))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor (_ bv0 32) .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor .cse1 .cse2) .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv14 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse3 .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse4)) (and (= |ULTIMATE.start_main_~z~0#1| .cse1) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~z~0#1| .cse5)) (and (= |ULTIMATE.start_main_~z~0#1| .cse3) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse1 .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse6 .cse0))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor (bvor .cse6 (let ((.cse9 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)))) (let ((.cse8 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse7 .cse8) .cse9) (bvshl (bvand .cse10 .cse8) .cse11))))) .cse2) .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= |ULTIMATE.start_main_~z~0#1| .cse6)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse12 (bvor (bvshl (bvand .cse7 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv16 32))))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv4 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse13 .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~z~0#1| .cse12)) (and (= |ULTIMATE.start_main_~z~0#1| .cse13) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor .cse6 .cse2) .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32)))))))))))) [2021-12-15 08:55:56,090 INFO L858 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2021-12-15 08:55:56,092 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2021-12-15 08:55:56,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 08:55:56,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:55:56 BoogieIcfgContainer [2021-12-15 08:55:56,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 08:55:56,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 08:55:56,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 08:55:56,136 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 08:55:56,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:15" (3/4) ... [2021-12-15 08:55:56,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 08:55:56,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-12-15 08:55:56,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-15 08:55:56,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-15 08:55:56,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 08:55:56,179 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 08:55:56,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 08:55:56,179 INFO L158 Benchmark]: Toolchain (without parser) took 41315.69ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.3MB in the beginning and 24.8MB in the end (delta: 12.5MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2021-12-15 08:55:56,180 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:56,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.82ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 41.0MB in the end (delta: -3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 08:55:56,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.51ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 39.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:56,181 INFO L158 Benchmark]: Boogie Preprocessor took 35.37ms. Allocated memory is still 58.7MB. Free memory was 39.5MB in the beginning and 38.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:55:56,181 INFO L158 Benchmark]: RCFGBuilder took 252.47ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 29.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 08:55:56,181 INFO L158 Benchmark]: TraceAbstraction took 40681.38ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 31.2MB in the end (delta: -2.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2021-12-15 08:55:56,181 INFO L158 Benchmark]: Witness Printer took 43.12ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 24.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 08:55:56,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.82ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 41.0MB in the end (delta: -3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.51ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 39.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.37ms. Allocated memory is still 58.7MB. Free memory was 39.5MB in the beginning and 38.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.47ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 29.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40681.38ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 31.2MB in the end (delta: -2.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 43.12ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 24.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 30 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 35.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, 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, 25 NumberOfFragments, 2149 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1461 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 381 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10149 SizeOfPredicates, 13 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((i == 1bv32 && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i)))) || (i == 7bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~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))))) || (i == 14bv32 && 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), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~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))))) || (i == 8bv32 && z == ~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))))) || (z == ~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))) && i == 5bv32)) || (i == 2bv32 && z == ~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(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))) && i == 13bv32)) || (z == ~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))) && i == 6bv32)) || (i == 10bv32 && 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), 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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~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))) && i == 12bv32)) || (i == 9bv32 && 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), 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))))) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32)))) || (i == 4bv32 && z == ~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))))) || (i == 15bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))))) || (z == ~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))) && i == 3bv32)) || (z == ~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), ~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))) && i == 11bv32)) || (i == 0bv32 && z == 0bv32) RESULT: Ultimate proved your program to be correct! [2021-12-15 08:55:56,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE