./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 5fbdf5bf 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 b8ee9428aad4e911e10cde7de8379310dde1b70a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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 b8ee9428aad4e911e10cde7de8379310dde1b70a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 02:58:45,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 02:58:45,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 02:58:45,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 02:58:45,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 02:58:45,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 02:58:45,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 02:58:45,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 02:58:45,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 02:58:45,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 02:58:45,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 02:58:45,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 02:58:45,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 02:58:45,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 02:58:45,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 02:58:45,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 02:58:45,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 02:58:45,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 02:58:45,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 02:58:45,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 02:58:45,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 02:58:45,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 02:58:45,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 02:58:45,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 02:58:45,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 02:58:45,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 02:58:45,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 02:58:45,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 02:58:45,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 02:58:45,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 02:58:45,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 02:58:45,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 02:58:45,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 02:58:45,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 02:58:45,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 02:58:45,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 02:58:45,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 02:58:45,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 02:58:45,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 02:58:45,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 02:58:45,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 02:58:45,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 02:58:45,279 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 02:58:45,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 02:58:45,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 02:58:45,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 02:58:45,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 02:58:45,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 02:58:45,283 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 02:58:45,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 02:58:45,283 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 02:58:45,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 02:58:45,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 02:58:45,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 02:58:45,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 02:58:45,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 02:58:45,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 02:58:45,285 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 02:58:45,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 02:58:45,286 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 02:58:45,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 02:58:45,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 02:58:45,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 02:58:45,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 02:58:45,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 02:58:45,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 02:58:45,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 02:58:45,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 02:58:45,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 02:58:45,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 02:58:45,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 02:58:45,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 02:58:45,288 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 -> b8ee9428aad4e911e10cde7de8379310dde1b70a [2021-08-29 02:58:45,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 02:58:45,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 02:58:45,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 02:58:45,645 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 02:58:45,645 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 02:58:45,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-08-29 02:58:45,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9262d52/c78fe192903f457984feb063035dc97a/FLAG44edd3a0f [2021-08-29 02:58:46,168 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 02:58:46,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-08-29 02:58:46,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9262d52/c78fe192903f457984feb063035dc97a/FLAG44edd3a0f [2021-08-29 02:58:46,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9262d52/c78fe192903f457984feb063035dc97a [2021-08-29 02:58:46,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 02:58:46,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 02:58:46,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 02:58:46,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 02:58:46,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 02:58:46,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c92c13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46, skipping insertion in model container [2021-08-29 02:58:46,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 02:58:46,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 02:58:46,328 WARN L228 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[870,883] [2021-08-29 02:58:46,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 02:58:46,373 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 02:58:46,417 WARN L228 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[870,883] [2021-08-29 02:58:46,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 02:58:46,456 INFO L208 MainTranslator]: Completed translation [2021-08-29 02:58:46,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46 WrapperNode [2021-08-29 02:58:46,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 02:58:46,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 02:58:46,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 02:58:46,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 02:58:46,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 02:58:46,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 02:58:46,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 02:58:46,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 02:58:46,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 02:58:46,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 02:58:46,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 02:58:46,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 02:58:46,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (1/1) ... [2021-08-29 02:58:46,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 02:58:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 02:58:46,555 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-08-29 02:58:46,578 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-08-29 02:58:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 02:58:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 02:58:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 02:58:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 02:58:46,734 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 02:58:46,734 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-29 02:58:46,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:46 BoogieIcfgContainer [2021-08-29 02:58:46,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 02:58:46,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 02:58:46,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 02:58:46,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 02:58:46,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:58:46" (1/3) ... [2021-08-29 02:58:46,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422dd949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:58:46, skipping insertion in model container [2021-08-29 02:58:46,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:46" (2/3) ... [2021-08-29 02:58:46,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422dd949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:58:46, skipping insertion in model container [2021-08-29 02:58:46,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:46" (3/3) ... [2021-08-29 02:58:46,743 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-08-29 02:58:46,748 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 02:58:46,748 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 02:58:46,812 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 02:58:46,819 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, mConcurrency=FINITE_AUTOMATA, 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-08-29 02:58:46,820 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 02:58:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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-08-29 02:58:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-29 02:58:46,841 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:46,842 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-29 02:58:46,843 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-08-29 02:58:46,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 02:58:46,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797134009] [2021-08-29 02:58:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:46,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 02:58:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:47,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 02:58:47,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797134009] [2021-08-29 02:58:47,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797134009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 02:58:47,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 02:58:47,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 02:58:47,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723209201] [2021-08-29 02:58:47,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 02:58:47,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 02:58:47,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 02:58:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 02:58:47,111 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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) 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-08-29 02:58:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:47,173 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2021-08-29 02:58:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 02:58:47,176 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-08-29 02:58:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:47,194 INFO L225 Difference]: With dead ends: 18 [2021-08-29 02:58:47,194 INFO L226 Difference]: Without dead ends: 8 [2021-08-29 02:58:47,197 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 02:58:47,199 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.21ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:47,200 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 47.21ms Time] [2021-08-29 02:58:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-08-29 02:58:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-29 02:58:47,222 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-08-29 02:58:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-08-29 02:58:47,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-08-29 02:58:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:47,224 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-08-29 02:58:47,224 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-08-29 02:58:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-08-29 02:58:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-29 02:58:47,225 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:47,225 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:47,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 02:58:47,226 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:47,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-08-29 02:58:47,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 02:58:47,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245938202] [2021-08-29 02:58:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:47,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 02:58:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:47,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 02:58:47,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245938202] [2021-08-29 02:58:47,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245938202] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 02:58:47,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628740662] [2021-08-29 02:58:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:47,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 02:58:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 02:58:47,309 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-08-29 02:58:47,310 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-08-29 02:58:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:47,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 02:58:47,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:47,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628740662] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:47,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 02:58:47,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-29 02:58:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90669227] [2021-08-29 02:58:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 02:58:47,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 02:58:47,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 02:58:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-08-29 02:58:47,447 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-08-29 02:58:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:47,483 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-08-29 02:58:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 02:58:47,483 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-08-29 02:58:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:47,484 INFO L225 Difference]: With dead ends: 15 [2021-08-29 02:58:47,484 INFO L226 Difference]: Without dead ends: 11 [2021-08-29 02:58:47,485 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 41.05ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-08-29 02:58:47,485 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.41ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.72ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:47,486 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.41ms Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 21.72ms Time] [2021-08-29 02:58:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-08-29 02:58:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-08-29 02:58:47,488 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-08-29 02:58:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-08-29 02:58:47,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-08-29 02:58:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:47,489 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-08-29 02:58:47,490 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-08-29 02:58:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-08-29 02:58:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 02:58:47,490 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:47,490 INFO L513 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:47,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 02:58:47,713 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-08-29 02:58:47,713 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-08-29 02:58:47,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 02:58:47,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864664908] [2021-08-29 02:58:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:47,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 02:58:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:47,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 02:58:47,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864664908] [2021-08-29 02:58:47,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864664908] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 02:58:47,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894327847] [2021-08-29 02:58:47,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 02:58:47,852 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 02:58:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 02:58:47,854 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-08-29 02:58:47,855 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-08-29 02:58:47,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 02:58:47,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 02:58:47,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-29 02:58:47,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:48,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:48,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894327847] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:48,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 02:58:48,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-08-29 02:58:48,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845492770] [2021-08-29 02:58:48,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 02:58:48,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 02:58:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 02:58:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-08-29 02:58:48,184 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-08-29 02:58:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:48,485 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-08-29 02:58:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 02:58:48,486 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-08-29 02:58:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:48,486 INFO L225 Difference]: With dead ends: 21 [2021-08-29 02:58:48,486 INFO L226 Difference]: Without dead ends: 17 [2021-08-29 02:58:48,487 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 380.73ms TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2021-08-29 02:58:48,488 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.93ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:48,489 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 82.93ms Time] [2021-08-29 02:58:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-08-29 02:58:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-29 02:58:48,495 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-08-29 02:58:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-08-29 02:58:48,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-08-29 02:58:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:48,497 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-08-29 02:58:48,497 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-08-29 02:58:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-08-29 02:58:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 02:58:48,498 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:48,498 INFO L513 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:48,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 02:58:48,709 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-08-29 02:58:48,709 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-08-29 02:58:48,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 02:58:48,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217084389] [2021-08-29 02:58:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:48,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 02:58:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:48,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 02:58:48,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217084389] [2021-08-29 02:58:48,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217084389] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 02:58:48,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916276397] [2021-08-29 02:58:48,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 02:58:48,967 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 02:58:48,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 02:58:48,971 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-08-29 02:58:48,974 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-08-29 02:58:49,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-08-29 02:58:49,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 02:58:49,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 02:58:49,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:49,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:49,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916276397] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:49,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 02:58:49,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-08-29 02:58:49,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214254593] [2021-08-29 02:58:49,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-29 02:58:49,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 02:58:49,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-29 02:58:49,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2021-08-29 02:58:49,483 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-08-29 02:58:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:49,907 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-08-29 02:58:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-29 02:58:49,907 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-08-29 02:58:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:49,908 INFO L225 Difference]: With dead ends: 27 [2021-08-29 02:58:49,908 INFO L226 Difference]: Without dead ends: 23 [2021-08-29 02:58:49,909 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 596.80ms TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2021-08-29 02:58:49,910 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.01ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.62ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:49,910 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 3.01ms Time], IncrementalHoareTripleChecker [19 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 126.62ms Time] [2021-08-29 02:58:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-08-29 02:58:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-08-29 02:58:49,914 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-08-29 02:58:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-08-29 02:58:49,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2021-08-29 02:58:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:49,915 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-08-29 02:58:49,916 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-08-29 02:58:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-08-29 02:58:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 02:58:49,916 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:49,917 INFO L513 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:49,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-29 02:58:50,121 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-08-29 02:58:50,121 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-08-29 02:58:50,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 02:58:50,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045469810] [2021-08-29 02:58:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:50,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 02:58:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 02:58:50,167 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 02:58:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 02:58:50,219 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 02:58:50,219 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 02:58:50,220 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 02:58:50,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 02:58:50,227 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 02:58:50,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 02:58:50 BoogieIcfgContainer [2021-08-29 02:58:50,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 02:58:50,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 02:58:50,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 02:58:50,266 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 02:58:50,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:46" (3/4) ... [2021-08-29 02:58:50,269 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-29 02:58:50,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 02:58:50,270 INFO L158 Benchmark]: Toolchain (without parser) took 4072.01ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.5MB in the beginning and 26.8MB in the end (delta: 5.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-08-29 02:58:50,271 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:58:50,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.50ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 37.1MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 02:58:50,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.98ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:58:50,272 INFO L158 Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 54.5MB. Free memory was 35.6MB in the beginning and 34.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:58:50,272 INFO L158 Benchmark]: RCFGBuilder took 207.57ms. Allocated memory is still 54.5MB. Free memory was 34.5MB in the beginning and 26.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 02:58:50,272 INFO L158 Benchmark]: TraceAbstraction took 3526.71ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 27.3MB in the end (delta: -1.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2021-08-29 02:58:50,272 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 67.1MB. Free memory was 27.3MB in the beginning and 26.8MB in the end (delta: 489.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:58:50,275 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.22ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.50ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 37.1MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.98ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.69ms. Allocated memory is still 54.5MB. Free memory was 35.6MB in the beginning and 34.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 207.57ms. Allocated memory is still 54.5MB. Free memory was 34.5MB in the beginning and 26.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3526.71ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 27.3MB in the end (delta: -1.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 67.1MB. Free memory was 27.3MB in the beginning and 26.8MB in the end (delta: 489.0kB). 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: 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 56, overapproximation of bitwiseAnd at line 47. Possible FailurePath: [L34] unsigned short x = __VERIFIER_nondet_ushort(); [L35] unsigned short y = __VERIFIER_nondet_ushort(); [L36] unsigned int xx; [L37] unsigned int yy; [L38] unsigned int zz; [L39] unsigned int z = 0; [L40] unsigned int i = 0; [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND TRUE i < sizeof(x) * 8 [L42] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L43] i += 1U [L41] COND FALSE !(i < sizeof(x) * 8) [L45] xx = x [L46] yy = y [L47] xx = (xx | (xx << 8u)) & 16711935U [L48] xx = (xx | (xx << 4u)) & 252645135U [L49] xx = (xx | (xx << 2u)) & 858993459U [L50] xx = (xx | (xx << 1u)) & 1431655765U [L51] yy = (yy | (yy << 8u)) & 16711935U [L52] yy = (yy | (yy << 4u)) & 252645135U [L53] yy = (yy | (yy << 2u)) & 858993459U [L54] yy = (yy | (yy << 1u)) & 1431655765U [L56] zz = xx | (yy << 1U) [L16] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3415.44ms, OverallIterations: 5, TraceHistogramMax: 16, EmptinessCheckTime: 15.26ms, AutomataDifference: 893.81ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8.72ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 278.49ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 192.58ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 0 mSDtfsCounter, 318 mSolverCounterSat, 5.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1038.70ms Time, 0.00ms 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.00ms DumpTime, AutomataMinimizationStatistics: 25.07ms AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 44.62ms SsaConstructionTime, 239.85ms SatisfiabilityAnalysisTime, 1279.62ms InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 3 NumberOfNonLiveVariables, 168 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-08-29 02:58:50,291 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... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 02:58:52,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 02:58:52,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 02:58:52,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 02:58:52,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 02:58:52,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 02:58:52,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 02:58:52,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 02:58:52,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 02:58:52,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 02:58:52,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 02:58:52,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 02:58:52,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 02:58:52,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 02:58:52,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 02:58:52,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 02:58:52,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 02:58:52,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 02:58:52,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 02:58:52,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 02:58:52,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 02:58:52,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 02:58:52,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 02:58:52,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 02:58:52,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 02:58:52,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 02:58:52,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 02:58:52,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 02:58:52,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 02:58:52,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 02:58:52,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 02:58:52,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 02:58:52,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 02:58:52,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 02:58:52,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 02:58:52,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 02:58:52,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 02:58:52,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 02:58:52,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 02:58:52,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 02:58:52,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 02:58:52,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-29 02:58:52,183 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 02:58:52,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 02:58:52,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 02:58:52,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 02:58:52,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 02:58:52,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 02:58:52,186 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 02:58:52,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 02:58:52,186 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 02:58:52,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 02:58:52,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 02:58:52,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 02:58:52,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 02:58:52,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 02:58:52,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-29 02:58:52,188 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-29 02:58:52,188 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 02:58:52,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 02:58:52,188 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 02:58:52,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 02:58:52,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 02:58:52,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 02:58:52,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 02:58:52,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 02:58:52,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 02:58:52,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 02:58:52,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 02:58:52,190 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-29 02:58:52,191 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-29 02:58:52,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 02:58:52,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 02:58:52,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-29 02:58:52,191 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 -> b8ee9428aad4e911e10cde7de8379310dde1b70a [2021-08-29 02:58:52,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 02:58:52,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 02:58:52,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 02:58:52,530 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 02:58:52,530 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 02:58:52,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-08-29 02:58:52,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea79bcd86/c744606439ee46568a8662e46e54eb8d/FLAG40196d606 [2021-08-29 02:58:53,060 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 02:58:53,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-08-29 02:58:53,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea79bcd86/c744606439ee46568a8662e46e54eb8d/FLAG40196d606 [2021-08-29 02:58:53,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea79bcd86/c744606439ee46568a8662e46e54eb8d [2021-08-29 02:58:53,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 02:58:53,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 02:58:53,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 02:58:53,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 02:58:53,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 02:58:53,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfe6635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53, skipping insertion in model container [2021-08-29 02:58:53,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 02:58:53,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 02:58:53,207 WARN L228 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[870,883] [2021-08-29 02:58:53,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 02:58:53,238 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 02:58:53,249 WARN L228 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[870,883] [2021-08-29 02:58:53,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 02:58:53,285 INFO L208 MainTranslator]: Completed translation [2021-08-29 02:58:53,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53 WrapperNode [2021-08-29 02:58:53,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 02:58:53,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 02:58:53,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 02:58:53,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 02:58:53,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 02:58:53,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 02:58:53,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 02:58:53,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 02:58:53,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 02:58:53,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 02:58:53,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 02:58:53,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 02:58:53,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (1/1) ... [2021-08-29 02:58:53,360 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 02:58:53,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 02:58:53,380 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-08-29 02:58:53,408 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-08-29 02:58:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-29 02:58:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 02:58:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 02:58:53,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 02:58:53,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 02:58:53,595 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-29 02:58:53,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:53 BoogieIcfgContainer [2021-08-29 02:58:53,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 02:58:53,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 02:58:53,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 02:58:53,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 02:58:53,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:58:53" (1/3) ... [2021-08-29 02:58:53,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362cae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:58:53, skipping insertion in model container [2021-08-29 02:58:53,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:58:53" (2/3) ... [2021-08-29 02:58:53,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362cae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:58:53, skipping insertion in model container [2021-08-29 02:58:53,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:53" (3/3) ... [2021-08-29 02:58:53,608 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-08-29 02:58:53,613 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 02:58:53,614 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 02:58:53,661 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 02:58:53,669 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, mConcurrency=FINITE_AUTOMATA, 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-08-29 02:58:53,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 02:58:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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-08-29 02:58:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-29 02:58:53,699 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:53,700 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-29 02:58:53,700 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-08-29 02:58:53,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-29 02:58:53,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421123965] [2021-08-29 02:58:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:53,718 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-29 02:58:53,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-29 02:58:53,733 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-08-29 02:58:53,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-29 02:58:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:53,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-29 02:58:53,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:53,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:53,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-29 02:58:53,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421123965] [2021-08-29 02:58:53,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421123965] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-29 02:58:53,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-29 02:58:53,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-29 02:58:53,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138940859] [2021-08-29 02:58:53,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 02:58:53,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-29 02:58:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 02:58:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 02:58:54,015 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08-29 02:58:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:54,073 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2021-08-29 02:58:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 02:58:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) Word has length 6 [2021-08-29 02:58:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:54,081 INFO L225 Difference]: With dead ends: 19 [2021-08-29 02:58:54,082 INFO L226 Difference]: Without dead ends: 9 [2021-08-29 02:58:54,089 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.77ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 02:58:54,093 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.99ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:54,095 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 38.99ms Time] [2021-08-29 02:58:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-08-29 02:58:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-29 02:58:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08-29 02:58:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-08-29 02:58:54,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2021-08-29 02:58:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:54,127 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-08-29 02:58:54,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08-29 02:58:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-08-29 02:58:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-29 02:58:54,128 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:54,128 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:54,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-29 02:58:54,337 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-08-29 02:58:54,338 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times [2021-08-29 02:58:54,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-29 02:58:54,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678694201] [2021-08-29 02:58:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 02:58:54,345 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-29 02:58:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-29 02:58:54,347 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-08-29 02:58:54,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-29 02:58:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 02:58:54,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-29 02:58:54,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:54,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:54,546 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-29 02:58:54,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678694201] [2021-08-29 02:58:54,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678694201] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:54,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 02:58:54,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-29 02:58:54,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138873870] [2021-08-29 02:58:54,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 02:58:54,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-29 02:58:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 02:58:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-29 02:58:54,549 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-08-29 02:58:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:54,628 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2021-08-29 02:58:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 02:58:54,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 8 [2021-08-29 02:58:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:54,629 INFO L225 Difference]: With dead ends: 17 [2021-08-29 02:58:54,629 INFO L226 Difference]: Without dead ends: 13 [2021-08-29 02:58:54,630 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 81.01ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-29 02:58:54,631 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.62ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.44ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:54,631 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.62ms Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 42.44ms Time] [2021-08-29 02:58:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-08-29 02:58:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-08-29 02:58:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-08-29 02:58:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-08-29 02:58:54,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2021-08-29 02:58:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:54,636 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-08-29 02:58:54,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-08-29 02:58:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-08-29 02:58:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 02:58:54,637 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:54,637 INFO L513 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:54,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-29 02:58:54,846 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-08-29 02:58:54,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 2 times [2021-08-29 02:58:54,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-29 02:58:54,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878181655] [2021-08-29 02:58:54,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 02:58:54,848 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-29 02:58:54,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-29 02:58:54,849 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-08-29 02:58:54,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-29 02:58:54,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 02:58:54,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 02:58:54,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 02:58:54,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:55,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:55,174 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-29 02:58:55,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878181655] [2021-08-29 02:58:55,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878181655] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:55,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 02:58:55,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-08-29 02:58:55,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407453691] [2021-08-29 02:58:55,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-29 02:58:55,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-29 02:58:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-29 02:58:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-08-29 02:58:55,177 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08-29 02:58:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:55,470 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-08-29 02:58:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-29 02:58:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 12 [2021-08-29 02:58:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:55,472 INFO L225 Difference]: With dead ends: 25 [2021-08-29 02:58:55,472 INFO L226 Difference]: Without dead ends: 21 [2021-08-29 02:58:55,473 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 314.30ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-08-29 02:58:55,474 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.36ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:55,475 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 104.36ms Time] [2021-08-29 02:58:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-08-29 02:58:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-29 02:58:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-08-29 02:58:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2021-08-29 02:58:55,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2021-08-29 02:58:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:55,481 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2021-08-29 02:58:55,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08-29 02:58:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-08-29 02:58:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 02:58:55,481 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:55,481 INFO L513 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:55,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-29 02:58:55,693 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-08-29 02:58:55,694 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2078182539, now seen corresponding path program 3 times [2021-08-29 02:58:55,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-29 02:58:55,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503633113] [2021-08-29 02:58:55,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 02:58:55,695 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-29 02:58:55,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-29 02:58:55,696 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-08-29 02:58:55,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-29 02:58:55,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-08-29 02:58:55,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 02:58:55,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-29 02:58:55,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:56,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:58:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:56,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-29 02:58:56,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503633113] [2021-08-29 02:58:56,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503633113] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:58:56,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 02:58:56,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-08-29 02:58:56,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238034] [2021-08-29 02:58:56,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-29 02:58:56,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-29 02:58:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-29 02:58:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2021-08-29 02:58:56,612 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-08-29 02:58:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:58:58,070 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2021-08-29 02:58:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-29 02:58:58,070 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 20 [2021-08-29 02:58:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:58:58,071 INFO L225 Difference]: With dead ends: 41 [2021-08-29 02:58:58,071 INFO L226 Difference]: Without dead ends: 37 [2021-08-29 02:58:58,072 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1825.09ms TimeCoverageRelationStatistics Valid=622, Invalid=1540, Unknown=0, NotChecked=0, Total=2162 [2021-08-29 02:58:58,073 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.65ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 165.63ms IncrementalHoareTripleChecker+Time [2021-08-29 02:58:58,074 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 2.65ms Time], IncrementalHoareTripleChecker [43 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 165.63ms Time] [2021-08-29 02:58:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-08-29 02:58:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-08-29 02:58:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-08-29 02:58:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-08-29 02:58:58,081 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2021-08-29 02:58:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:58:58,081 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-08-29 02:58:58,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-08-29 02:58:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-08-29 02:58:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 02:58:58,082 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 02:58:58,083 INFO L513 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-08-29 02:58:58,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-29 02:58:58,293 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-08-29 02:58:58,293 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 02:58:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 02:58:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-08-29 02:58:58,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-29 02:58:58,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812923797] [2021-08-29 02:58:58,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 02:58:58,295 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-29 02:58:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-29 02:58:58,296 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-08-29 02:58:58,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-29 02:58:58,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 02:58:58,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 02:58:58,380 WARN L261 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-29 02:58:58,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 02:58:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 02:58:59,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 02:59:37,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x~0 (_ BitVec 16)) (ULTIMATE.start_main_~y~0 (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse1 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (= (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 .cse1 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse0 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse1 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse1 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse1 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse0 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse1 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse1 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse1 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse1 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse0 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse1 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse0 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse1 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse1 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse1 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse1 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse1 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse1 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse1 (_ bv32768 32)) (_ bv16 32)))) (let ((.cse31 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv15 32)))) (bvor (let ((.cse29 (bvadd (_ bv14 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse27 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv13 32)))) (bvor (let ((.cse25 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv12 32)))) (bvor (let ((.cse23 (bvadd (_ bv11 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse21 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv10 32)))) (bvor (let ((.cse19 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv9 32)))) (bvor (let ((.cse17 (bvadd (_ bv8 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse15 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv7 32)))) (bvor (let ((.cse13 (bvadd (_ bv6 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse11 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv5 32)))) (bvor (let ((.cse9 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse7 (bvadd (_ bv3 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse5 (bvadd (_ bv2 32) c_ULTIMATE.start_main_~i~0))) (bvor (let ((.cse3 (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1 32)))) (bvor (bvor c_ULTIMATE.start_main_~z~0 (let ((.cse2 (bvshl (_ bv1 32) c_ULTIMATE.start_main_~i~0))) (bvor (bvshl (bvand .cse0 .cse2) c_ULTIMATE.start_main_~i~0) (bvshl (bvand .cse1 .cse2) .cse3)))) (let ((.cse4 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse0 .cse4) .cse3) (bvshl (bvand .cse1 .cse4) .cse5))))) (let ((.cse6 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse0 .cse6) .cse5) (bvshl (bvand .cse1 .cse6) .cse7))))) (let ((.cse8 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse0 .cse8) .cse7) (bvshl (bvand .cse1 .cse8) .cse9))))) (let ((.cse10 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse0 .cse10) .cse9) (bvshl (bvand .cse1 .cse10) .cse11))))) (let ((.cse12 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse12) .cse11) (bvshl (bvand .cse1 .cse12) .cse13))))) (let ((.cse14 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse14) .cse13) (bvshl (bvand .cse1 .cse14) .cse15))))) (let ((.cse16 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse0 .cse16) .cse15) (bvshl (bvand .cse1 .cse16) .cse17))))) (let ((.cse18 (bvshl (_ bv1 32) .cse17))) (bvor (bvshl (bvand .cse0 .cse18) .cse17) (bvshl (bvand .cse1 .cse18) .cse19))))) (let ((.cse20 (bvshl (_ bv1 32) .cse19))) (bvor (bvshl (bvand .cse0 .cse20) .cse19) (bvshl (bvand .cse1 .cse20) .cse21))))) (let ((.cse22 (bvshl (_ bv1 32) .cse21))) (bvor (bvshl (bvand .cse0 .cse22) .cse21) (bvshl (bvand .cse1 .cse22) .cse23))))) (let ((.cse24 (bvshl (_ bv1 32) .cse23))) (bvor (bvshl (bvand .cse0 .cse24) .cse23) (bvshl (bvand .cse1 .cse24) .cse25))))) (let ((.cse26 (bvshl (_ bv1 32) .cse25))) (bvor (bvshl (bvand .cse0 .cse26) .cse25) (bvshl (bvand .cse1 .cse26) .cse27))))) (let ((.cse28 (bvshl (_ bv1 32) .cse27))) (bvor (bvshl (bvand .cse0 .cse28) .cse27) (bvshl (bvand .cse1 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse0 .cse30) .cse29) (bvshl (bvand .cse1 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse0 .cse32) .cse31) (bvshl (bvand .cse1 .cse32) (bvadd (_ bv16 32) c_ULTIMATE.start_main_~i~0))))))))) is different from false [2021-08-29 02:59:37,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-08-29 02:59:37,448 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-29 02:59:37,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812923797] [2021-08-29 02:59:37,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812923797] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 02:59:37,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 02:59:37,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-08-29 02:59:37,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802536913] [2021-08-29 02:59:37,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-29 02:59:37,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-29 02:59:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-29 02:59:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2021-08-29 02:59:37,451 INFO L87 Difference]: Start difference. First operand 37 states and 38 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-08-29 02:59:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 02:59:39,228 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2021-08-29 02:59:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-29 02:59:39,228 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-08-29 02:59:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 02:59:39,229 INFO L225 Difference]: With dead ends: 37 [2021-08-29 02:59:39,229 INFO L226 Difference]: Without dead ends: 0 [2021-08-29 02:59:39,230 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 38150.03ms TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2021-08-29 02:59:39,231 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1469.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 1604.66ms IncrementalHoareTripleChecker+Time [2021-08-29 02:59:39,231 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [16 Valid, 306 Invalid, 0 Unknown, 20 Unchecked, 1604.66ms Time] [2021-08-29 02:59:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-29 02:59:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-29 02:59:39,232 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-08-29 02:59:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-29 02:59:39,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-08-29 02:59:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 02:59:39,233 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-29 02:59:39,233 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-08-29 02:59:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-29 02:59:39,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-29 02:59:39,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 02:59:39,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-29 02:59:39,447 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-08-29 02:59:39,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-29 02:59:39,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 02:59:39,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 02:59:40,452 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-29 02:59:40,453 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2021-08-29 02:59:40,454 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 1 59) the Hoare annotation is: true [2021-08-29 02:59:40,454 INFO L854 garLoopResultBuilder]: At program point L41-2(lines 41 44) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse11 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (let ((.cse14 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse10 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse11 (_ bv1 32)) (_ bv1 32)))))) (let ((.cse9 (bvor .cse14 (bvor (bvshl (bvand .cse10 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse11 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse6 (bvor .cse9 (bvor (bvshl (bvand .cse10 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse11 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse4 (bvor .cse6 (bvor (bvshl (bvand .cse10 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse11 (_ bv8 32)) (_ bv4 32)))))) (let ((.cse13 (bvor .cse4 (bvor (bvshl (bvand .cse10 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse11 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse1 (bvor .cse13 (bvor (bvshl (bvand .cse10 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse11 (_ bv32 32)) (_ bv6 32)))))) (let ((.cse0 (bvor .cse1 (bvor (bvshl (bvand .cse10 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse11 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse8 (bvor .cse0 (bvor (bvshl (bvand .cse10 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse11 (_ bv128 32)) (_ bv8 32)))))) (let ((.cse7 (bvor (bvor .cse8 (bvor (bvshl (bvand .cse10 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse11 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse10 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse11 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse12 (bvor .cse7 (bvor (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse11 (_ bv1024 32)) (_ bv11 32)))))) (let ((.cse2 (bvor (bvor .cse12 (bvor (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse11 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse11 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse5 (bvor (bvor .cse2 (bvor (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse11 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse11 (_ bv16384 32)) (_ bv15 32))))) (.cse3 (let ((.cse16 (bvadd (_ bv4294967295 32) ULTIMATE.start_main_~i~0))) (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse10 .cse15) .cse16) (bvshl (bvand .cse11 .cse15) ULTIMATE.start_main_~i~0)))))) (or (and (= ULTIMATE.start_main_~z~0 .cse0) (= ULTIMATE.start_main_~i~0 (_ bv7 32))) (and (= ULTIMATE.start_main_~z~0 .cse1) (= (_ bv6 32) ULTIMATE.start_main_~i~0)) (and (= (_ bv14 32) ULTIMATE.start_main_~i~0) (= (bvor .cse2 .cse3) ULTIMATE.start_main_~z~0)) (and (= (_ bv4 32) ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~z~0 .cse4)) (and (= ULTIMATE.start_main_~z~0 .cse5) (= ULTIMATE.start_main_~i~0 (_ bv15 32))) (and (= ULTIMATE.start_main_~i~0 (_ bv13 32)) (= .cse2 ULTIMATE.start_main_~z~0)) (and (= .cse6 ULTIMATE.start_main_~z~0) (= (_ bv3 32) ULTIMATE.start_main_~i~0)) (and (= ULTIMATE.start_main_~z~0 .cse7) (= ULTIMATE.start_main_~i~0 (_ bv10 32))) (and (= (_ bv8 32) ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~z~0 .cse8)) (and (= ULTIMATE.start_main_~i~0 (_ bv9 32)) (= ULTIMATE.start_main_~z~0 (bvor .cse8 .cse3))) (and (= (_ bv2 32) ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~z~0 .cse9)) (= (bvor .cse5 (bvor (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse11 (_ bv32768 32)) (_ bv16 32)))) ULTIMATE.start_main_~z~0) (and (= ULTIMATE.start_main_~i~0 (_ bv12 32)) (= (bvor .cse12 .cse3) ULTIMATE.start_main_~z~0)) (and (= ULTIMATE.start_main_~z~0 .cse13) (= ULTIMATE.start_main_~i~0 (_ bv5 32))) (and (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= .cse14 ULTIMATE.start_main_~z~0)) (and (= (_ bv11 32) ULTIMATE.start_main_~i~0) (= .cse12 ULTIMATE.start_main_~z~0)) (and (= ULTIMATE.start_main_~z~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32))))))))))))))))) [2021-08-29 02:59:40,454 INFO L858 garLoopResultBuilder]: For program point L41-3(lines 41 44) no Hoare annotation was computed. [2021-08-29 02:59:40,457 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 02:59:40,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 02:59:40 BoogieIcfgContainer [2021-08-29 02:59:40,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 02:59:40,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 02:59:40,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 02:59:40,517 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 02:59:40,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:58:53" (3/4) ... [2021-08-29 02:59:40,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-29 02:59:40,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-29 02:59:40,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-29 02:59:40,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 02:59:40,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 02:59:40,573 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 02:59:40,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 02:59:40,574 INFO L158 Benchmark]: Toolchain (without parser) took 47494.06ms. Allocated memory was 50.3MB in the beginning and 77.6MB in the end (delta: 27.3MB). Free memory was 27.6MB in the beginning and 38.2MB in the end (delta: -10.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-08-29 02:59:40,574 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:59:40,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.87ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 47.3MB in the end (delta: -19.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-29 02:59:40,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.34ms. Allocated memory is still 62.9MB. Free memory was 47.1MB in the beginning and 45.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:59:40,576 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 02:59:40,576 INFO L158 Benchmark]: RCFGBuilder took 247.74ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 35.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 02:59:40,576 INFO L158 Benchmark]: TraceAbstraction took 46912.69ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 44.5MB in the end (delta: -9.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2021-08-29 02:59:40,577 INFO L158 Benchmark]: Witness Printer took 57.47ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 38.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-29 02:59:40,579 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.38ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.87ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.4MB in the beginning and 47.3MB in the end (delta: -19.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.34ms. Allocated memory is still 62.9MB. Free memory was 47.1MB in the beginning and 45.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.74ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 35.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46912.69ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 44.5MB in the end (delta: -9.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 57.47ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 38.2MB in the end (delta: 6.3MB). 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46797.31ms, OverallIterations: 5, TraceHistogramMax: 16, EmptinessCheckTime: 20.02ms, AutomataDifference: 3737.49ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 1003.97ms, InitialAbstractionConstructionTime: 12.03ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 1956.09ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1757.34ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 0 mSDtfsCounter, 711 mSolverCounterSat, 8.35ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 40386.20ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 32.80ms AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 33 NumberOfFragments, 2051 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3445 FormulaSimplificationTreeSizeReduction, 142.47ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 232 FormulaSimplificationTreeSizeReductionInter, 856.49ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 42.19ms SsaConstructionTime, 220.49ms SatisfiabilityAnalysisTime, 40454.56ms InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 126 ConstructedInterpolants, 1 QuantifiedInterpolants, 10142 SizeOfPredicates, 13 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 120/530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))) && i == 7bv32) || (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), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))) && 6bv32 == i)) || (14bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))) == z)) || (4bv32 == i && 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), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))))) || (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))) && i == 15bv32)) || (i == 13bv32 && ~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))) == 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))) == z && 3bv32 == i)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 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))) && i == 10bv32)) || (8bv32 == i && 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))))) || (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), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))))) || (2bv32 == i && 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))))) || ~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))) == z) || (i == 12bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))) == z)) || (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 == 1bv32 && ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))) == z)) || (11bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) == z)) || (z == 0bv32 && i == 0bv32) RESULT: Ultimate proved your program to be correct! [2021-08-29 02:59:40,653 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...