./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:24:16,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:24:16,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:24:16,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:24:16,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:24:16,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:24:16,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:24:16,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:24:16,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:24:16,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:24:16,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:24:16,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:24:16,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:24:16,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:24:16,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:24:16,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:24:16,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:24:16,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:24:16,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:24:16,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:24:16,337 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:24:16,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:24:16,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:24:16,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:24:16,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:24:16,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:24:16,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:24:16,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:24:16,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:24:16,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:24:16,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:24:16,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:24:16,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:24:16,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:24:16,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:24:16,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:24:16,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:24:16,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:24:16,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:24:16,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:24:16,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:24:16,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:24:16,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:24:16,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:24:16,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:24:16,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:24:16,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:24:16,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:24:16,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:24:16,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:24:16,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:24:16,390 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:24:16,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:24:16,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:24:16,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:24:16,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:24:16,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:24:16,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:24:16,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:24:16,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:24:16,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:24:16,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:24:16,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:24:16,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:24:16,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:24:16,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:24:16,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:24:16,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:24:16,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:24:16,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:24:16,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:24:16,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:24:16,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:24:16,405 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:24:16,405 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:24:16,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:24:16,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2022-07-13 11:24:16,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:24:16,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:24:16,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:24:16,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:24:16,647 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:24:16,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-13 11:24:16,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc51a8e/d863782b6d84404b9cbaae7a709ca6f0/FLAGf90521aa6 [2022-07-13 11:24:17,033 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:24:17,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-13 11:24:17,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc51a8e/d863782b6d84404b9cbaae7a709ca6f0/FLAGf90521aa6 [2022-07-13 11:24:17,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc51a8e/d863782b6d84404b9cbaae7a709ca6f0 [2022-07-13 11:24:17,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:24:17,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:24:17,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:24:17,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:24:17,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:24:17,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2ca8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17, skipping insertion in model container [2022-07-13 11:24:17,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:24:17,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:24:17,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2022-07-13 11:24:17,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:24:17,635 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:24:17,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2022-07-13 11:24:17,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:24:17,683 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:24:17,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17 WrapperNode [2022-07-13 11:24:17,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:24:17,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:24:17,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:24:17,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:24:17,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,763 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2022-07-13 11:24:17,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:24:17,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:24:17,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:24:17,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:24:17,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:24:17,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:24:17,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:24:17,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:24:17,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (1/1) ... [2022-07-13 11:24:17,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:24:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:17,879 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) [2022-07-13 11:24:17,897 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 [2022-07-13 11:24:17,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:24:17,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:24:17,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:24:17,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:24:17,973 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:24:17,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:24:18,442 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:24:18,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:24:18,471 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:24:18,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:18 BoogieIcfgContainer [2022-07-13 11:24:18,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:24:18,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:24:18,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:24:18,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:24:18,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:24:17" (1/3) ... [2022-07-13 11:24:18,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6f1ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:18, skipping insertion in model container [2022-07-13 11:24:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:17" (2/3) ... [2022-07-13 11:24:18,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6f1ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:18, skipping insertion in model container [2022-07-13 11:24:18,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:18" (3/3) ... [2022-07-13 11:24:18,491 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2022-07-13 11:24:18,505 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:24:18,505 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:24:18,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:24:18,558 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c51f236, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c3bf9c9 [2022-07-13 11:24:18,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:24:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 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) [2022-07-13 11:24:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:24:18,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:18,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:18,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 545893010, now seen corresponding path program 1 times [2022-07-13 11:24:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824247186] [2022-07-13 11:24:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824247186] [2022-07-13 11:24:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824247186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:24:18,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:24:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:24:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094955310] [2022-07-13 11:24:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:24:18,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:24:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:18,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:24:18,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:18,845 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:18,950 INFO L93 Difference]: Finished difference Result 124 states and 221 transitions. [2022-07-13 11:24:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:24:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:24:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:18,965 INFO L225 Difference]: With dead ends: 124 [2022-07-13 11:24:18,966 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 11:24:18,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:18,972 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:18,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 100 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:24:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 11:24:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-07-13 11:24:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 states have internal predecessors, (92), 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) [2022-07-13 11:24:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2022-07-13 11:24:19,009 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 16 [2022-07-13 11:24:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:19,010 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2022-07-13 11:24:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2022-07-13 11:24:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:24:19,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:19,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:19,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:24:19,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -255758641, now seen corresponding path program 1 times [2022-07-13 11:24:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:19,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10715217] [2022-07-13 11:24:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10715217] [2022-07-13 11:24:19,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10715217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:24:19,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:24:19,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:24:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293378482] [2022-07-13 11:24:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:24:19,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:24:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:24:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:19,079 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) [2022-07-13 11:24:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:19,100 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2022-07-13 11:24:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:24:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) Word has length 17 [2022-07-13 11:24:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:19,102 INFO L225 Difference]: With dead ends: 126 [2022-07-13 11:24:19,103 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 11:24:19,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:19,108 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:19,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:24:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 11:24:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-13 11:24:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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) [2022-07-13 11:24:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2022-07-13 11:24:19,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 17 [2022-07-13 11:24:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:19,119 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2022-07-13 11:24:19,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) [2022-07-13 11:24:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2022-07-13 11:24:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:24:19,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:19,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:19,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:24:19,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:19,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1991346358, now seen corresponding path program 1 times [2022-07-13 11:24:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:19,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951577155] [2022-07-13 11:24:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:19,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:19,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951577155] [2022-07-13 11:24:19,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951577155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:24:19,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478567638] [2022-07-13 11:24:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:19,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:19,287 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) [2022-07-13 11:24:19,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:24:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:19,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:24:19,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:19,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:19,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478567638] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:19,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:24:19,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 11:24:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156114947] [2022-07-13 11:24:19,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:24:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:24:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:24:19,464 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-07-13 11:24:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:19,499 INFO L93 Difference]: Finished difference Result 129 states and 187 transitions. [2022-07-13 11:24:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:24:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 18 [2022-07-13 11:24:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:19,501 INFO L225 Difference]: With dead ends: 129 [2022-07-13 11:24:19,501 INFO L226 Difference]: Without dead ends: 68 [2022-07-13 11:24:19,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:24:19,502 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:19,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:24:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-13 11:24:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-13 11:24:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 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) [2022-07-13 11:24:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-07-13 11:24:19,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 18 [2022-07-13 11:24:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:19,509 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-07-13 11:24:19,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-07-13 11:24:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-07-13 11:24:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:24:19,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:19,510 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:19,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:19,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash 805123471, now seen corresponding path program 2 times [2022-07-13 11:24:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:19,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827433180] [2022-07-13 11:24:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:19,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:19,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827433180] [2022-07-13 11:24:19,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827433180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:24:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194938183] [2022-07-13 11:24:19,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:24:19,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:19,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:19,924 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) [2022-07-13 11:24:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:24:20,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:24:20,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:20,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:24:20,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:20,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:20,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194938183] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:20,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:24:20,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 11:24:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062935896] [2022-07-13 11:24:20,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 11:24:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 11:24:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:24:20,268 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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) [2022-07-13 11:24:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:20,498 INFO L93 Difference]: Finished difference Result 135 states and 196 transitions. [2022-07-13 11:24:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:24:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 21 [2022-07-13 11:24:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:20,499 INFO L225 Difference]: With dead ends: 135 [2022-07-13 11:24:20,499 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 11:24:20,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:24:20,501 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:20,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:24:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 11:24:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 11:24:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 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) [2022-07-13 11:24:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2022-07-13 11:24:20,509 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 21 [2022-07-13 11:24:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:20,509 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-07-13 11:24:20,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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) [2022-07-13 11:24:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2022-07-13 11:24:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:24:20,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:20,510 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:20,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:20,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 11:24:20,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -951891025, now seen corresponding path program 3 times [2022-07-13 11:24:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:20,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926018044] [2022-07-13 11:24:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:21,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926018044] [2022-07-13 11:24:21,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926018044] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:24:21,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649303233] [2022-07-13 11:24:21,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:24:21,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:21,177 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) [2022-07-13 11:24:21,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:24:21,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 11:24:21,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:21,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 11:24:21,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:21,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649303233] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:21,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:24:21,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-13 11:24:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773153174] [2022-07-13 11:24:21,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 11:24:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 11:24:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:24:21,888 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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) [2022-07-13 11:24:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:22,383 INFO L93 Difference]: Finished difference Result 141 states and 202 transitions. [2022-07-13 11:24:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:24:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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 27 [2022-07-13 11:24:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:22,388 INFO L225 Difference]: With dead ends: 141 [2022-07-13 11:24:22,388 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 11:24:22,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2022-07-13 11:24:22,389 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:22,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 978 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:24:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 11:24:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-13 11:24:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 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) [2022-07-13 11:24:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-07-13 11:24:22,399 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 27 [2022-07-13 11:24:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:22,399 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-07-13 11:24:22,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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) [2022-07-13 11:24:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-07-13 11:24:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:24:22,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:22,401 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:22,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:22,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:22,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1209513521, now seen corresponding path program 4 times [2022-07-13 11:24:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:22,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552111688] [2022-07-13 11:24:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:24:23,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:24:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:24:23,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:24:23,498 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:24:23,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:24:23,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:24:23,503 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-13 11:24:23,506 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:24:23,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:24:23 BoogieIcfgContainer [2022-07-13 11:24:23,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:24:23,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:24:23,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:24:23,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:24:23,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:18" (3/4) ... [2022-07-13 11:24:23,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:24:23,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:24:23,536 INFO L158 Benchmark]: Toolchain (without parser) took 6088.72ms. Allocated memory was 88.1MB in the beginning and 165.7MB in the end (delta: 77.6MB). Free memory was 45.0MB in the beginning and 113.0MB in the end (delta: -68.0MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,536 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:24:23,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.45ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 44.8MB in the beginning and 84.1MB in the end (delta: -39.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.97ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 71.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,537 INFO L158 Benchmark]: Boogie Preprocessor took 85.99ms. Allocated memory is still 115.3MB. Free memory was 71.9MB in the beginning and 63.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,538 INFO L158 Benchmark]: RCFGBuilder took 620.87ms. Allocated memory is still 115.3MB. Free memory was 63.6MB in the beginning and 84.4MB in the end (delta: -20.8MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,538 INFO L158 Benchmark]: TraceAbstraction took 5056.77ms. Allocated memory was 115.3MB in the beginning and 165.7MB in the end (delta: 50.3MB). Free memory was 83.9MB in the beginning and 113.0MB in the end (delta: -29.1MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2022-07-13 11:24:23,538 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 165.7MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:24:23,539 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.45ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 44.8MB in the beginning and 84.1MB in the end (delta: -39.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.97ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 71.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.99ms. Allocated memory is still 115.3MB. Free memory was 71.9MB in the beginning and 63.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 620.87ms. Allocated memory is still 115.3MB. Free memory was 63.6MB in the beginning and 84.4MB in the end (delta: -20.8MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5056.77ms. Allocated memory was 115.3MB in the beginning and 165.7MB in the end (delta: 50.3MB). Free memory was 83.9MB in the beginning and 113.0MB in the end (delta: -29.1MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 165.7MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 62. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, z=4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, z=4294967295] [L53] xx = x [L54] yy = y VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L64] zz = xx | (yy << 1U) VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295, zz=0] [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1877 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1567 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 310 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 3 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 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 [2022-07-13 11:24:23,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:24:25,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:24:25,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:24:25,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:24:25,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:24:25,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:24:25,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:24:25,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:24:25,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:24:25,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:24:25,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:24:25,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:24:25,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:24:25,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:24:25,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:24:25,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:24:25,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:24:25,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:24:25,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:24:25,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:24:25,421 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:24:25,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:24:25,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:24:25,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:24:25,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:24:25,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:24:25,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:24:25,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:24:25,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:24:25,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:24:25,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:24:25,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:24:25,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:24:25,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:24:25,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:24:25,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:24:25,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:24:25,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:24:25,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:24:25,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:24:25,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:24:25,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:24:25,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:24:25,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:24:25,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:24:25,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:24:25,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:24:25,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:24:25,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:24:25,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:24:25,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:24:25,495 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:24:25,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:24:25,495 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:24:25,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:24:25,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:24:25,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:24:25,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:24:25,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:24:25,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:24:25,497 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:24:25,497 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:24:25,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:24:25,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:24:25,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:24:25,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:24:25,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:24:25,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:24:25,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:24:25,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:24:25,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:24:25,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:24:25,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:24:25,499 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:24:25,500 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:24:25,500 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:24:25,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:24:25,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:24:25,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:24:25,501 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2022-07-13 11:24:25,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:24:25,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:24:25,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:24:25,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:24:25,804 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:24:25,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-13 11:24:25,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271eb0cb8/8b924f081d3845c69fbb8743c2ec12d6/FLAGe54552c9b [2022-07-13 11:24:26,239 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:24:26,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-13 11:24:26,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271eb0cb8/8b924f081d3845c69fbb8743c2ec12d6/FLAGe54552c9b [2022-07-13 11:24:26,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271eb0cb8/8b924f081d3845c69fbb8743c2ec12d6 [2022-07-13 11:24:26,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:24:26,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:24:26,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:24:26,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:24:26,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:24:26,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24804a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26, skipping insertion in model container [2022-07-13 11:24:26,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:24:26,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:24:26,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2022-07-13 11:24:26,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:24:26,870 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:24:26,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2022-07-13 11:24:26,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:24:26,914 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:24:26,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26 WrapperNode [2022-07-13 11:24:26,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:24:26,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:24:26,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:24:26,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:24:26,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,949 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2022-07-13 11:24:26,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:24:26,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:24:26,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:24:26,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:24:26,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:26,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:24:26,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:24:26,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:24:26,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:24:26,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (1/1) ... [2022-07-13 11:24:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:24:27,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:27,020 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) [2022-07-13 11:24:27,046 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 [2022-07-13 11:24:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:24:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:24:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:24:27,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:24:27,129 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:24:27,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:24:27,287 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:24:27,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:24:27,292 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:24:27,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:27 BoogieIcfgContainer [2022-07-13 11:24:27,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:24:27,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:24:27,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:24:27,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:24:27,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:24:26" (1/3) ... [2022-07-13 11:24:27,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723e395c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:27, skipping insertion in model container [2022-07-13 11:24:27,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:26" (2/3) ... [2022-07-13 11:24:27,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723e395c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:27, skipping insertion in model container [2022-07-13 11:24:27,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:27" (3/3) ... [2022-07-13 11:24:27,313 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2022-07-13 11:24:27,331 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:24:27,347 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:24:27,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:24:27,414 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e02f563, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c9b9c93 [2022-07-13 11:24:27,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:24:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 11:24:27,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:27,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 11:24:27,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-13 11:24:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:24:27,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810682192] [2022-07-13 11:24:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:24:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:24:27,455 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) [2022-07-13 11:24:27,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:24:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:27,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:24:27,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:27,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:24:27,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:24:27,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810682192] [2022-07-13 11:24:27,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810682192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:24:27,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:24:27,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:24:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580282298] [2022-07-13 11:24:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:24:27,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:24:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:24:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:24:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:27,607 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:27,627 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-13 11:24:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:24:27,630 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 [2022-07-13 11:24:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:27,635 INFO L225 Difference]: With dead ends: 20 [2022-07-13 11:24:27,635 INFO L226 Difference]: Without dead ends: 8 [2022-07-13 11:24:27,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:24:27,640 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:27,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:24:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-13 11:24:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-13 11:24:27,663 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) [2022-07-13 11:24:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-13 11:24:27,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-13 11:24:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:27,666 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-13 11:24:27,667 INFO L496 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) [2022-07-13 11:24:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-13 11:24:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 11:24:27,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:27,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:27,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:27,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:24:27,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-07-13 11:24:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:24:27,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045581861] [2022-07-13 11:24:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:24:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:24:27,880 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) [2022-07-13 11:24:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:24:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:24:27,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:24:27,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:27,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:27,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:24:27,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045581861] [2022-07-13 11:24:27,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045581861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:27,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:24:27,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 11:24:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742019131] [2022-07-13 11:24:27,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:24:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:24:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:24:27,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:24:27,962 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:27,992 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-07-13 11:24:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:24:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 11:24:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:27,993 INFO L225 Difference]: With dead ends: 15 [2022-07-13 11:24:27,994 INFO L226 Difference]: Without dead ends: 11 [2022-07-13 11:24:27,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:24:27,996 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:27,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:24:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-13 11:24:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-13 11:24:27,999 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) [2022-07-13 11:24:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-13 11:24:28,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-07-13 11:24:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:28,000 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-13 11:24:28,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-13 11:24:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 11:24:28,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:28,001 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:28,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:24:28,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-07-13 11:24:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:24:28,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288144789] [2022-07-13 11:24:28,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:24:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:24:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:24:28,205 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) [2022-07-13 11:24:28,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:24:28,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:24:28,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:28,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:24:28,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:28,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:28,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:24:28,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288144789] [2022-07-13 11:24:28,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288144789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:28,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:24:28,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-13 11:24:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985325065] [2022-07-13 11:24:28,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:24:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:24:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:24:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:24:28,428 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:28,614 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-13 11:24:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:24:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 11:24:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:28,616 INFO L225 Difference]: With dead ends: 21 [2022-07-13 11:24:28,617 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 11:24:28,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:24:28,618 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:28,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:24:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 11:24:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 11:24:28,622 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) [2022-07-13 11:24:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-07-13 11:24:28,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-07-13 11:24:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:28,627 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-07-13 11:24:28,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-07-13 11:24:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:24:28,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:28,629 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:28,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:28,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:24:28,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2022-07-13 11:24:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:24:28,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971292171] [2022-07-13 11:24:28,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:24:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:24:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:24:28,844 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) [2022-07-13 11:24:28,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:24:28,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 11:24:28,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:28,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:24:28,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:29,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:29,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:24:29,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971292171] [2022-07-13 11:24:29,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971292171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:29,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:24:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-13 11:24:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275138032] [2022-07-13 11:24:29,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:29,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:24:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:24:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:24:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:24:29,457 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:30,496 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-13 11:24:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:24:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:24:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:30,498 INFO L225 Difference]: With dead ends: 33 [2022-07-13 11:24:30,498 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 11:24:30,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 11:24:30,499 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:30,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:24:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 11:24:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-13 11:24:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-07-13 11:24:30,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2022-07-13 11:24:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:30,508 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-13 11:24:30,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-07-13 11:24:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:24:30,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:30,509 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:30,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 11:24:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:24:30,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2022-07-13 11:24:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:24:30,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551055536] [2022-07-13 11:24:30,721 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:24:30,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:24:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:24:30,723 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) [2022-07-13 11:24:30,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:24:30,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:24:30,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:30,823 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-13 11:24:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:32,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:06,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~y~0#1| (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|))) (= (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse1 (_ bv16384 32)) (_ bv14 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse1 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv12 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse1 (_ bv1024 32)) (_ bv10 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse1 (_ bv128 32)) (_ bv7 32))) (bvor (bvor (bvor (bvor (bvshl (bvand (_ bv16 32) .cse1) (_ bv4 32)) (bvshl (bvand .cse0 (_ bv16 32)) (_ bv5 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse1 (_ bv8 32)) (_ bv3 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse1 (_ bv4 32)) (_ bv2 32))) (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse1 (_ bv1 32)) (_ bv0 32)))) (bvor (bvshl (bvand .cse1 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse0 (_ bv2 32)) (_ bv2 32))))))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse1 (_ bv32 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse1 (_ bv64 32)) (_ bv6 32))))) (bvor (bvshl (bvand (_ bv256 32) .cse1) (_ bv8 32)) (bvshl (bvand .cse0 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse1 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse0 (_ bv512 32)) (_ bv10 32)))))) (bvor (bvshl (bvand .cse1 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse1 (_ bv8192 32)) (_ bv13 32))))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse1 (_ bv32768 32)) (_ bv15 32)))) (let ((.cse31 (bvadd (_ bv15 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse29 (bvadd (_ bv14 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse4 (bvadd (_ bv13 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse3 (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse2 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse1 .cse2) .cse3) (bvshl (bvand .cse0 .cse2) .cse4))) (let ((.cse6 (bvadd (_ bv11 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse5 (bvshl (_ bv1 32) .cse6))) (bvor (bvshl (bvand .cse0 .cse5) .cse3) (bvshl (bvand .cse1 .cse5) .cse6))) (let ((.cse8 (bvadd (_ bv10 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse7 (bvshl (_ bv1 32) .cse8))) (bvor (bvshl (bvand .cse1 .cse7) .cse8) (bvshl (bvand .cse0 .cse7) .cse6))) (let ((.cse26 (bvadd (_ bv9 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse10 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse11 (bvadd (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse9 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse9) .cse10) (bvshl (bvand .cse1 .cse9) .cse11))) (let ((.cse13 (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse14 (bvadd (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse12 (bvshl (_ bv1 32) .cse14))) (bvor (bvshl (bvand .cse0 .cse12) .cse13) (bvshl (bvand .cse1 .cse12) .cse14))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse0 .cse15) .cse14) (bvshl (bvand .cse1 .cse15) .cse16))) (let ((.cse18 (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse17 (bvshl (_ bv1 32) .cse18))) (bvor (bvshl (bvand .cse0 .cse17) .cse16) (bvshl (bvand .cse1 .cse17) .cse18))) (let ((.cse22 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse20 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse19 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse19) .cse20) (bvshl (bvand .cse1 .cse19) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse21 (bvshl (_ bv1 32) .cse20))) (bvor (bvshl (bvand .cse1 .cse21) .cse20) (bvshl (bvand .cse0 .cse21) .cse22))))) (let ((.cse23 (bvshl (_ bv1 32) .cse22))) (bvor (bvshl (bvand .cse1 .cse23) .cse22) (bvshl (bvand .cse0 .cse23) .cse18))))))))))) (let ((.cse24 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse24) .cse11) (bvshl (bvand .cse1 .cse24) .cse13))))))) (let ((.cse25 (bvshl (_ bv1 32) .cse10))) (bvor (bvshl (bvand .cse1 .cse25) .cse10) (bvshl (bvand .cse0 .cse25) .cse26))))) (let ((.cse27 (bvshl (_ bv1 32) .cse26))) (bvor (bvshl (bvand .cse1 .cse27) .cse26) (bvshl (bvand .cse0 .cse27) .cse8))))))))))) (let ((.cse28 (bvshl (_ bv1 32) .cse4))) (bvor (bvshl (bvand .cse28 .cse1) .cse4) (bvshl (bvand .cse0 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse1 .cse30) .cse29) (bvshl (bvand .cse0 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse32 .cse0) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~i~0#1|)) (bvshl (bvand .cse32 .cse1) .cse31)))))))) is different from false [2022-07-13 11:25:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-13 11:25:06,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:25:06,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551055536] [2022-07-13 11:25:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551055536] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:06,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:25:06,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2022-07-13 11:25:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501999977] [2022-07-13 11:25:06,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:06,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 11:25:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:25:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 11:25:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2022-07-13 11:25:06,805 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:08,589 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-13 11:25:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:25:08,589 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 [2022-07-13 11:25:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:08,590 INFO L225 Difference]: With dead ends: 29 [2022-07-13 11:25:08,590 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:25:08,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2022-07-13 11:25:08,592 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:08,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.6s Time] [2022-07-13 11:25:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:25:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:25:08,594 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) [2022-07-13 11:25:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:25:08,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-07-13 11:25:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:08,594 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:25:08,594 INFO L496 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) [2022-07-13 11:25:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:25:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:25:08,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:25:08,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:25:08,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:25:08,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:25:09,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:25:09,648 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-07-13 11:25:09,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2022-07-13 11:25:09,650 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2022-07-13 11:25:09,650 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse6 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse5 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (bvor (bvor (bvshl (bvand .cse5 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv2 32))) (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse5 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse6 (_ bv1 32)) (_ bv0 32)))) (bvor (bvshl (bvand .cse6 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse5 (_ bv2 32)) (_ bv2 32))))))) (let ((.cse15 (bvor (bvor (bvshl (bvand (_ bv16 32) .cse6) (_ bv4 32)) (bvshl (bvand .cse5 (_ bv16 32)) (_ bv5 32))) (bvor (bvor (bvshl (bvand .cse5 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse6 (_ bv8 32)) (_ bv3 32))) .cse1)))) (let ((.cse7 (bvor .cse15 (bvor (bvshl (bvand .cse5 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv5 32)))))) (let ((.cse14 (bvor (bvor (bvshl (bvand .cse5 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse6 (_ bv128 32)) (_ bv7 32))) (bvor .cse7 (bvor (bvshl (bvand .cse5 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse6 (_ bv64 32)) (_ bv6 32))))))) (let ((.cse2 (bvor .cse14 (bvor (bvshl (bvand (_ bv256 32) .cse6) (_ bv8 32)) (bvshl (bvand .cse5 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse3 (bvor .cse2 (bvor (bvshl (bvand .cse6 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse5 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse9 (bvor (bvor (bvshl (bvand .cse5 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse6 (_ bv1024 32)) (_ bv10 32))) .cse3))) (let ((.cse10 (bvor (bvor (bvshl (bvand .cse6 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse5 (_ bv2048 32)) (_ bv12 32))) .cse9))) (let ((.cse12 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|)) (.cse8 (bvor .cse10 (bvor (bvshl (bvand .cse6 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse5 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse0 (bvor (bvor (bvshl (bvand .cse5 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse6 (_ bv16384 32)) (_ bv14 32))) (bvor .cse8 (bvor (bvshl (bvand .cse5 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse6 (_ bv8192 32)) (_ bv13 32)))))) (.cse4 (let ((.cse16 (bvshl (_ bv1 32) .cse12))) (bvor (bvshl (bvand .cse6 .cse16) .cse12) (bvshl (bvand .cse5 .cse16) |ULTIMATE.start_main_~i~0#1|))))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~z~0#1| .cse0)) (and (= |ULTIMATE.start_main_~z~0#1| .cse1) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= |ULTIMATE.start_main_~z~0#1| .cse2)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~z~0#1| .cse3)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (bvor .cse4 (_ bv0 32)) |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse0 (bvor (bvshl (bvand .cse5 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse6 (_ bv32768 32)) (_ bv15 32))))) (and (= (bvor .cse7 .cse4) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse8 .cse4)) (= (_ bv14 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32)) (= |ULTIMATE.start_main_~z~0#1| .cse9)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32)) (= |ULTIMATE.start_main_~z~0#1| .cse10)) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse4 (bvor (let ((.cse13 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)))) (let ((.cse11 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse5 .cse11) .cse12) (bvshl (bvand .cse6 .cse11) .cse13)))) (_ bv0 32)))) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse14)) (and (= .cse7 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32))) (and (= .cse8 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= .cse15 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse1 .cse4)) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)))))))))))))) [2022-07-13 11:25:09,650 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2022-07-13 11:25:09,653 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-07-13 11:25:09,654 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:25:09,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:25:09 BoogieIcfgContainer [2022-07-13 11:25:09,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:25:09,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:25:09,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:25:09,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:25:09,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:27" (3/4) ... [2022-07-13 11:25:09,708 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:25:09,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-13 11:25:09,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 11:25:09,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:25:09,717 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:25:09,757 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:25:09,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:25:09,758 INFO L158 Benchmark]: Toolchain (without parser) took 43128.96ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.5MB in the beginning and 20.3MB in the end (delta: 14.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,758 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:25:09,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.23ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 38.3MB in the end (delta: -4.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.69ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 36.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:25:09,759 INFO L158 Benchmark]: Boogie Preprocessor took 41.02ms. Allocated memory is still 56.6MB. Free memory was 36.7MB in the beginning and 35.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,759 INFO L158 Benchmark]: RCFGBuilder took 300.91ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 26.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,760 INFO L158 Benchmark]: TraceAbstraction took 42410.02ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.4MB in the beginning and 23.1MB in the end (delta: 2.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,760 INFO L158 Benchmark]: Witness Printer took 51.97ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 20.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:25:09,762 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.23ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 38.3MB in the end (delta: -4.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.69ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 36.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.02ms. Allocated memory is still 56.6MB. Free memory was 36.7MB in the beginning and 35.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.91ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 26.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42410.02ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.4MB in the beginning and 23.1MB in the end (delta: 2.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 51.97ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 20.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 30 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 2083 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1505 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 381 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10109 SizeOfPredicates, 13 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((i == 15bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 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), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32))))) || (z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))) && i == 3bv32)) || (i == 9bv32 && z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))))) || (i == 10bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))) || (i == 1bv32 && ~bvor32(~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)), 0bv32) == z)) || z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 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), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32)))) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~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 && i == 7bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 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), 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))) && 14bv32 == i)) || (i == 11bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32)))))) || (i == 12bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))))) || (z == ~bvor32(~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)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32))), 0bv32)) && i == 2bv32)) || (i == 8bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))))) || (~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))) == z && i == 6bv32)) || (i == 0bv32 && z == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 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), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))) == z && i == 13bv32)) || (~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))) == z && i == 5bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))), ~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))) && 4bv32 == i) RESULT: Ultimate proved your program to be correct! [2022-07-13 11:25:09,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE