./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:52:15,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:52:15,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:52:15,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:52:15,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:52:15,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:52:15,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:52:15,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:52:15,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:52:15,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:52:15,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:52:15,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:52:15,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:52:15,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:52:15,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:52:15,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:52:15,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:52:15,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:52:15,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:52:15,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:52:15,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:52:15,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:52:15,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:52:15,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:52:15,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:52:15,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:52:15,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:52:15,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:52:15,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:52:15,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:52:15,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:52:15,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:52:15,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:52:15,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:52:15,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:52:15,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:52:15,627 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:52:15,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:52:15,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:52:15,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:52:15,657 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:52:15,657 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:52:15,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:52:15,658 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:52:15,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:52:15,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:52:15,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:52:15,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:52:15,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:52:15,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:52:15,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:52:15,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:52:15,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:52:15,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:52:15,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:52:15,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:52:15,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:52:15,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:52:15,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:52:15,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:52:15,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-12-30 15:52:15,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:52:15,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:52:15,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:52:15,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:52:15,750 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:52:15,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:15,816 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d5a2d93/1899b2f9e7a24f278cfadee08963b586/FLAG9d4059cd4 [2018-12-30 15:52:16,308 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:52:16,309 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:16,316 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d5a2d93/1899b2f9e7a24f278cfadee08963b586/FLAG9d4059cd4 [2018-12-30 15:52:16,619 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d5a2d93/1899b2f9e7a24f278cfadee08963b586 [2018-12-30 15:52:16,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:52:16,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:52:16,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:16,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:52:16,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:52:16,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af59bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16, skipping insertion in model container [2018-12-30 15:52:16,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:52:16,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:52:16,836 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:16,840 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:52:16,865 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:16,882 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:52:16,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16 WrapperNode [2018-12-30 15:52:16,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:16,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:16,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:52:16,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:52:16,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:16,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:52:16,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:52:16,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:52:16,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... [2018-12-30 15:52:16,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:52:16,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:52:16,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:52:16,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:52:16,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:52:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:52:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:52:17,254 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:52:17,254 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 15:52:17,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:17 BoogieIcfgContainer [2018-12-30 15:52:17,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:52:17,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:52:17,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:52:17,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:52:17,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:52:16" (1/3) ... [2018-12-30 15:52:17,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aead144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:17, skipping insertion in model container [2018-12-30 15:52:17,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:16" (2/3) ... [2018-12-30 15:52:17,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aead144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:17, skipping insertion in model container [2018-12-30 15:52:17,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:17" (3/3) ... [2018-12-30 15:52:17,262 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:17,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:52:17,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:52:17,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:52:17,329 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:52:17,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:52:17,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:52:17,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:52:17,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:52:17,331 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:52:17,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:52:17,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:52:17,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:52:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-30 15:52:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:52:17,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:17,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:52:17,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2018-12-30 15:52:17,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:17,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:17,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:17,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:17,707 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-30 15:52:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:17,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:52:17,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:17,732 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-30 15:52:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:17,762 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-30 15:52:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:17,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-30 15:52:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:17,774 INFO L225 Difference]: With dead ends: 17 [2018-12-30 15:52:17,774 INFO L226 Difference]: Without dead ends: 7 [2018-12-30 15:52:17,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-30 15:52:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-30 15:52:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-30 15:52:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-30 15:52:17,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-30 15:52:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:17,812 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-30 15:52:17,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-30 15:52:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-30 15:52:17,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:17,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-30 15:52:17,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2018-12-30 15:52:17,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:17,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:17,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:17,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:17,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:18,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:18,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-12-30 15:52:18,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:52:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:52:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:52:18,087 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-12-30 15:52:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:18,143 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-30 15:52:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:52:18,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-30 15:52:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:18,144 INFO L225 Difference]: With dead ends: 12 [2018-12-30 15:52:18,144 INFO L226 Difference]: Without dead ends: 8 [2018-12-30 15:52:18,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:52:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-30 15:52:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-30 15:52:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-30 15:52:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-30 15:52:18,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-30 15:52:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:18,148 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-30 15:52:18,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:52:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-30 15:52:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-30 15:52:18,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:18,149 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-30 15:52:18,149 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2018-12-30 15:52:18,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:18,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:18,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:18,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:18,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:52:18,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:52:18,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:18,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:18,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:18,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-30 15:52:18,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:52:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:52:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:52:18,557 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2018-12-30 15:52:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:18,651 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-30 15:52:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:52:18,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-30 15:52:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:18,653 INFO L225 Difference]: With dead ends: 13 [2018-12-30 15:52:18,653 INFO L226 Difference]: Without dead ends: 9 [2018-12-30 15:52:18,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:52:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-30 15:52:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-30 15:52:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-30 15:52:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-30 15:52:18,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-30 15:52:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:18,657 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-30 15:52:18,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:52:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-30 15:52:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-30 15:52:18,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:18,658 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2018-12-30 15:52:18,658 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2018-12-30 15:52:18,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:18,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:18,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:18,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:18,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:18,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:18,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:52:18,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-30 15:52:18,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:18,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-30 15:52:18,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:52:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:52:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:52:18,866 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-12-30 15:52:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:19,004 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-30 15:52:19,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:52:19,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-30 15:52:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:19,007 INFO L225 Difference]: With dead ends: 14 [2018-12-30 15:52:19,007 INFO L226 Difference]: Without dead ends: 10 [2018-12-30 15:52:19,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:52:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-30 15:52:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-30 15:52:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-30 15:52:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-30 15:52:19,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-30 15:52:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:19,012 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-30 15:52:19,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:52:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-30 15:52:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-30 15:52:19,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:19,013 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2018-12-30 15:52:19,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2018-12-30 15:52:19,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:19,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:19,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:19,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:52:19,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:52:19,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:19,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:19,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:19,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-30 15:52:19,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:52:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:52:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:52:19,303 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-12-30 15:52:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:19,469 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-30 15:52:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 15:52:19,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-30 15:52:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:19,471 INFO L225 Difference]: With dead ends: 15 [2018-12-30 15:52:19,471 INFO L226 Difference]: Without dead ends: 11 [2018-12-30 15:52:19,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:52:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-30 15:52:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-30 15:52:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-30 15:52:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-30 15:52:19,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-30 15:52:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:19,479 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-30 15:52:19,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:52:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-30 15:52:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-30 15:52:19,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:19,480 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2018-12-30 15:52:19,480 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2018-12-30 15:52:19,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:19,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:19,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:19,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:19,887 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 15:52:19,902 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-30 15:52:19,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:19,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:19,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:19,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-30 15:52:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 15:52:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 15:52:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-30 15:52:19,955 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-12-30 15:52:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:20,033 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-30 15:52:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 15:52:20,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-12-30 15:52:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:20,034 INFO L225 Difference]: With dead ends: 16 [2018-12-30 15:52:20,035 INFO L226 Difference]: Without dead ends: 12 [2018-12-30 15:52:20,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-30 15:52:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-30 15:52:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-30 15:52:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-30 15:52:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-30 15:52:20,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-30 15:52:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:20,040 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-30 15:52:20,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 15:52:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-30 15:52:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:52:20,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:20,041 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2018-12-30 15:52:20,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2018-12-30 15:52:20,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:20,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:20,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:20,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:20,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:20,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:20,276 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-30 15:52:20,289 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-30 15:52:20,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:20,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:20,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:20,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-30 15:52:20,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 15:52:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 15:52:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-30 15:52:20,347 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-12-30 15:52:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:20,447 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-30 15:52:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 15:52:20,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-30 15:52:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:20,450 INFO L225 Difference]: With dead ends: 17 [2018-12-30 15:52:20,450 INFO L226 Difference]: Without dead ends: 13 [2018-12-30 15:52:20,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-30 15:52:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-30 15:52:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-30 15:52:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-30 15:52:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-30 15:52:20,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-30 15:52:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:20,454 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-30 15:52:20,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 15:52:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-30 15:52:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-30 15:52:20,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:20,455 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2018-12-30 15:52:20,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1310307538, now seen corresponding path program 7 times [2018-12-30 15:52:20,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:20,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:20,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:20,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:20,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:20,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:20,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:20,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:20,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-30 15:52:20,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 15:52:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 15:52:20,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:52:20,863 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-12-30 15:52:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:20,948 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-30 15:52:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 15:52:20,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-30 15:52:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:20,950 INFO L225 Difference]: With dead ends: 18 [2018-12-30 15:52:20,950 INFO L226 Difference]: Without dead ends: 14 [2018-12-30 15:52:20,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:52:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-30 15:52:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-30 15:52:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-30 15:52:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-30 15:52:20,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-30 15:52:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:20,954 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-30 15:52:20,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 15:52:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-30 15:52:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 15:52:20,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:20,955 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2018-12-30 15:52:20,955 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 8 times [2018-12-30 15:52:20,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:21,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:21,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:21,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:52:21,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:52:21,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:21,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:21,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-30 15:52:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 15:52:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 15:52:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:52:21,285 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-12-30 15:52:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:21,391 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-30 15:52:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 15:52:21,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-12-30 15:52:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:21,394 INFO L225 Difference]: With dead ends: 19 [2018-12-30 15:52:21,394 INFO L226 Difference]: Without dead ends: 15 [2018-12-30 15:52:21,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:52:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-30 15:52:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-30 15:52:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-30 15:52:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-30 15:52:21,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-30 15:52:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:21,398 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-30 15:52:21,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 15:52:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-30 15:52:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 15:52:21,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:21,399 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2018-12-30 15:52:21,400 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 833418130, now seen corresponding path program 9 times [2018-12-30 15:52:21,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:21,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:21,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:21,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:21,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:21,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:52:22,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-30 15:52:22,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:22,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:22,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:22,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-30 15:52:22,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 15:52:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 15:52:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:52:22,183 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-12-30 15:52:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:22,412 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-30 15:52:22,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 15:52:22,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-12-30 15:52:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:22,416 INFO L225 Difference]: With dead ends: 20 [2018-12-30 15:52:22,416 INFO L226 Difference]: Without dead ends: 16 [2018-12-30 15:52:22,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:52:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-30 15:52:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-30 15:52:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-30 15:52:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-30 15:52:22,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-30 15:52:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-30 15:52:22,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 15:52:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-30 15:52:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 15:52:22,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:22,421 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2018-12-30 15:52:22,422 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 67823624, now seen corresponding path program 10 times [2018-12-30 15:52:22,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:22,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:22,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:22,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:22,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:52:22,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:52:22,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:22,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:22,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-30 15:52:22,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 15:52:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 15:52:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-30 15:52:22,785 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-12-30 15:52:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:22,912 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-30 15:52:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 15:52:22,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-12-30 15:52:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:22,914 INFO L225 Difference]: With dead ends: 21 [2018-12-30 15:52:22,914 INFO L226 Difference]: Without dead ends: 17 [2018-12-30 15:52:22,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-30 15:52:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-30 15:52:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-30 15:52:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-30 15:52:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-30 15:52:22,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-30 15:52:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:22,918 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-30 15:52:22,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 15:52:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-30 15:52:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 15:52:22,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:22,919 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2018-12-30 15:52:22,919 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2104197714, now seen corresponding path program 11 times [2018-12-30 15:52:22,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:22,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:22,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:23,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:23,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:23,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 15:52:24,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-30 15:52:24,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:24,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:24,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-12-30 15:52:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-30 15:52:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-30 15:52:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-30 15:52:24,653 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-12-30 15:52:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:24,782 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-30 15:52:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 15:52:24,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-30 15:52:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:24,790 INFO L225 Difference]: With dead ends: 22 [2018-12-30 15:52:24,790 INFO L226 Difference]: Without dead ends: 18 [2018-12-30 15:52:24,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-30 15:52:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-30 15:52:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-30 15:52:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-30 15:52:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-30 15:52:24,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-30 15:52:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:24,799 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-30 15:52:24,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-30 15:52:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-30 15:52:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:52:24,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:24,800 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2018-12-30 15:52:24,800 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 807285064, now seen corresponding path program 12 times [2018-12-30 15:52:24,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:24,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:25,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:25,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-30 15:52:25,394 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-30 15:52:25,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:25,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-12-30 15:52:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-30 15:52:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-30 15:52:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-30 15:52:25,519 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-12-30 15:52:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:26,002 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-30 15:52:26,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 15:52:26,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-12-30 15:52:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:26,004 INFO L225 Difference]: With dead ends: 23 [2018-12-30 15:52:26,005 INFO L226 Difference]: Without dead ends: 19 [2018-12-30 15:52:26,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-30 15:52:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-30 15:52:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-30 15:52:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-30 15:52:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-30 15:52:26,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-30 15:52:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:26,010 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-30 15:52:26,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-30 15:52:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-30 15:52:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 15:52:26,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:26,011 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2018-12-30 15:52:26,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash -742301422, now seen corresponding path program 13 times [2018-12-30 15:52:26,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:26,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:26,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:26,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:26,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:26,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:26,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:26,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-12-30 15:52:26,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-30 15:52:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-30 15:52:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-30 15:52:26,652 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-12-30 15:52:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:27,015 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-30 15:52:27,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 15:52:27,016 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-30 15:52:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:27,017 INFO L225 Difference]: With dead ends: 24 [2018-12-30 15:52:27,017 INFO L226 Difference]: Without dead ends: 20 [2018-12-30 15:52:27,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-30 15:52:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-30 15:52:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-30 15:52:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-30 15:52:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-30 15:52:27,023 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-30 15:52:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:27,024 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-30 15:52:27,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-30 15:52:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-30 15:52:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 15:52:27,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:27,025 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2018-12-30 15:52:27,025 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 14 times [2018-12-30 15:52:27,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:27,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:27,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:27,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:52:27,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:52:27,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:27,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:27,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:27,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-12-30 15:52:27,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-30 15:52:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-30 15:52:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-30 15:52:27,615 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-12-30 15:52:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:27,797 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-30 15:52:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-30 15:52:27,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-30 15:52:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:27,799 INFO L225 Difference]: With dead ends: 25 [2018-12-30 15:52:27,800 INFO L226 Difference]: Without dead ends: 21 [2018-12-30 15:52:27,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-30 15:52:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-30 15:52:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-30 15:52:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-30 15:52:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-30 15:52:27,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-30 15:52:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:27,805 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-30 15:52:27,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-30 15:52:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-30 15:52:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 15:52:27,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:27,806 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2018-12-30 15:52:27,806 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash -333803566, now seen corresponding path program 15 times [2018-12-30 15:52:27,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:27,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:27,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:28,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:52:28,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:52:28,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:52:28,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-30 15:52:28,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:28,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:28,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:28,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-12-30 15:52:28,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-30 15:52:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-30 15:52:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-30 15:52:28,515 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-12-30 15:52:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:28,813 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-30 15:52:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 15:52:28,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2018-12-30 15:52:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:28,817 INFO L225 Difference]: With dead ends: 26 [2018-12-30 15:52:28,817 INFO L226 Difference]: Without dead ends: 22 [2018-12-30 15:52:28,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-30 15:52:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-30 15:52:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-30 15:52:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-30 15:52:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-30 15:52:28,822 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-30 15:52:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:28,822 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-30 15:52:28,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-30 15:52:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-30 15:52:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 15:52:28,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:28,823 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2018-12-30 15:52:28,823 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 16 times [2018-12-30 15:52:28,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:28,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:52:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:52:28,866 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 15:52:28,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:52:28 BoogieIcfgContainer [2018-12-30 15:52:28,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:52:28,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:52:28,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:52:28,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:52:28,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:17" (3/4) ... [2018-12-30 15:52:28,898 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-30 15:52:28,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:52:28,899 INFO L168 Benchmark]: Toolchain (without parser) took 12275.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 948.7 MB in the beginning and 822.3 MB in the end (delta: 126.3 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:28,900 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:28,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 936.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:28,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.34 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:28,903 INFO L168 Benchmark]: Boogie Preprocessor took 41.53 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:28,904 INFO L168 Benchmark]: RCFGBuilder took 282.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:28,905 INFO L168 Benchmark]: TraceAbstraction took 11635.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 822.3 MB in the end (delta: 295.7 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:28,906 INFO L168 Benchmark]: Witness Printer took 6.75 ms. Allocated memory is still 1.2 GB. Free memory is still 822.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:28,912 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 936.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.34 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.53 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11635.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 822.3 MB in the end (delta: 295.7 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.75 ms. Allocated memory is still 1.2 GB. Free memory is still 822.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND FALSE !(i < sizeof(x) * 8) [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 11.5s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 0 SDslu, 342 SDs, 0 SdLazy, 1722 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 165 SyntacticMatches, 16 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 28440 SizeOfPredicates, 15 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:52:31,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:52:31,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:52:31,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:52:31,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:52:31,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:52:31,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:52:31,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:52:31,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:52:31,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:52:31,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:52:31,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:52:31,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:52:31,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:52:31,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:52:31,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:52:31,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:52:31,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:52:31,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:52:31,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:52:31,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:52:31,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:52:31,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:52:31,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:52:31,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:52:31,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:52:31,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:52:31,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:52:31,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:52:31,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:52:31,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:52:31,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:52:31,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:52:31,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:52:31,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:52:31,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:52:31,312 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-30 15:52:31,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:52:31,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:52:31,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:52:31,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:52:31,341 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:52:31,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:52:31,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:52:31,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:52:31,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:52:31,342 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:52:31,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:52:31,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:52:31,343 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-30 15:52:31,344 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-30 15:52:31,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:52:31,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:52:31,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:52:31,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:52:31,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:52:31,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:52:31,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:52:31,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:52:31,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:52:31,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:52:31,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:52:31,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:52:31,347 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-30 15:52:31,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:52:31,348 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-30 15:52:31,348 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-30 15:52:31,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-12-30 15:52:31,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:52:31,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:52:31,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:52:31,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:52:31,407 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:52:31,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:31,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42d34c1/7c99770afdc447b5835376d5ac7c70be/FLAG51ce7c2bd [2018-12-30 15:52:31,958 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:52:31,959 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:31,965 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42d34c1/7c99770afdc447b5835376d5ac7c70be/FLAG51ce7c2bd [2018-12-30 15:52:32,318 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42d34c1/7c99770afdc447b5835376d5ac7c70be [2018-12-30 15:52:32,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:52:32,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:52:32,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:32,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:52:32,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:52:32,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76052153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32, skipping insertion in model container [2018-12-30 15:52:32,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:52:32,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:52:32,622 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:32,632 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:52:32,665 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:32,687 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:52:32,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32 WrapperNode [2018-12-30 15:52:32,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:32,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:32,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:52:32,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:52:32,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:32,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:52:32,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:52:32,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:52:32,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... [2018-12-30 15:52:32,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:52:32,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:52:32,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:52:32,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:52:32,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:52:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:52:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:52:33,242 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:52:33,242 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 15:52:33,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:33 BoogieIcfgContainer [2018-12-30 15:52:33,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:52:33,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:52:33,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:52:33,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:52:33,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:52:32" (1/3) ... [2018-12-30 15:52:33,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6786561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:33, skipping insertion in model container [2018-12-30 15:52:33,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:32" (2/3) ... [2018-12-30 15:52:33,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6786561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:33, skipping insertion in model container [2018-12-30 15:52:33,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:33" (3/3) ... [2018-12-30 15:52:33,256 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-30 15:52:33,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:52:33,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:52:33,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:52:33,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:52:33,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:52:33,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:52:33,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:52:33,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:52:33,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:52:33,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:52:33,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:52:33,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:52:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-30 15:52:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-30 15:52:33,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:33,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-30 15:52:33,352 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2018-12-30 15:52:33,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:52:33,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:52:33,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:33,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:33,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:52:33,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:33,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:52:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:33,596 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-30 15:52:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:33,648 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-30 15:52:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:33,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-30 15:52:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:33,670 INFO L225 Difference]: With dead ends: 17 [2018-12-30 15:52:33,670 INFO L226 Difference]: Without dead ends: 7 [2018-12-30 15:52:33,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-30 15:52:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-30 15:52:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-30 15:52:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-30 15:52:33,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-30 15:52:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:33,717 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-30 15:52:33,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-30 15:52:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-30 15:52:33,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:33,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-30 15:52:33,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2018-12-30 15:52:33,722 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:52:33,723 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:52:33,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:33,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:33,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:52:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:33,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:33,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-30 15:52:33,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:52:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:52:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:52:33,904 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-30 15:52:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:33,983 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-30 15:52:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:52:33,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-30 15:52:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:33,988 INFO L225 Difference]: With dead ends: 14 [2018-12-30 15:52:33,988 INFO L226 Difference]: Without dead ends: 10 [2018-12-30 15:52:33,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:52:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-30 15:52:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-30 15:52:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-30 15:52:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-30 15:52:33,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-12-30 15:52:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:33,994 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-30 15:52:33,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:52:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-30 15:52:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-30 15:52:33,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:33,995 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2018-12-30 15:52:33,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 2 times [2018-12-30 15:52:33,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:52:33,997 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:52:34,013 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-30 15:52:34,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:52:34,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:34,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:34,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:52:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:34,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-12-30 15:52:34,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 15:52:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 15:52:34,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:52:34,634 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 12 states. [2018-12-30 15:52:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:35,440 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-12-30 15:52:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 15:52:35,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-30 15:52:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:35,442 INFO L225 Difference]: With dead ends: 20 [2018-12-30 15:52:35,442 INFO L226 Difference]: Without dead ends: 16 [2018-12-30 15:52:35,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-12-30 15:52:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-30 15:52:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-30 15:52:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-30 15:52:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-30 15:52:35,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2018-12-30 15:52:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:35,450 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-30 15:52:35,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 15:52:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-30 15:52:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 15:52:35,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:35,451 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2018-12-30 15:52:35,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 67823624, now seen corresponding path program 3 times [2018-12-30 15:52:35,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:52:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:52:35,475 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-30 15:52:35,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-30 15:52:35,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:35,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:36,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:52:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 15:52:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:52:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-12-30 15:52:36,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-30 15:52:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-30 15:52:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-12-30 15:52:36,883 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 24 states. [2018-12-30 15:52:37,753 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-12-30 15:52:38,321 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-12-30 15:52:38,664 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-12-30 15:52:38,951 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-30 15:52:39,633 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-30 15:52:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:40,126 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-12-30 15:52:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-30 15:52:40,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 15 [2018-12-30 15:52:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:40,133 INFO L225 Difference]: With dead ends: 32 [2018-12-30 15:52:40,134 INFO L226 Difference]: Without dead ends: 28 [2018-12-30 15:52:40,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-12-30 15:52:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-30 15:52:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-30 15:52:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-30 15:52:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-30 15:52:40,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-12-30 15:52:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:40,146 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-30 15:52:40,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-30 15:52:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-30 15:52:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 15:52:40,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:40,148 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2018-12-30 15:52:40,149 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 4 times [2018-12-30 15:52:40,150 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:52:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:52:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:52:40,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:52:40,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:40,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:42,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:54:16,146 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 243 [2018-12-30 15:54:41,445 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2018-12-30 15:54:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:54:41,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:54:41,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-12-30 15:54:41,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-30 15:54:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-30 15:54:41,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2018-12-30 15:54:41,984 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 36 states. [2018-12-30 15:54:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:54:51,431 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-30 15:54:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-30 15:54:51,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 21 [2018-12-30 15:54:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:54:51,432 INFO L225 Difference]: With dead ends: 28 [2018-12-30 15:54:51,432 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 15:54:51,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 121.6s TimeCoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2018-12-30 15:54:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 15:54:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 15:54:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 15:54:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 15:54:51,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-30 15:54:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:54:51,435 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 15:54:51,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-30 15:54:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 15:54:51,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 15:54:51,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 15:54:51,588 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 263 [2018-12-30 15:54:53,972 WARN L181 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 263 DAG size of output: 214 [2018-12-30 15:54:53,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 15:54:53,979 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:54:53,979 INFO L451 ceAbstractionStarter]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2018-12-30 15:54:53,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 15:54:53,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:54:53,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 15:54:53,980 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 30 33) the Hoare annotation is: (let ((.cse9 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse10 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (let ((.cse5 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse9 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse10 (_ bv1 32)) (_ bv1 32)))))) (let ((.cse12 (bvor (bvor .cse5 (bvor (bvshl (bvand .cse9 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse10 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse9 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse10 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse8 (bvor (bvor .cse12 (bvor (bvshl (bvand .cse9 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse10 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse9 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse10 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse7 (bvor .cse8 (bvor (bvshl (bvand .cse9 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse10 (_ bv32 32)) (_ bv6 32)))))) (let ((.cse4 (bvor .cse7 (bvor (bvshl (bvand .cse9 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse10 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse0 (bvor (bvor .cse4 (bvor (bvshl (bvand .cse9 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse10 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse9 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse10 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse6 (bvor (bvor .cse0 (bvor (bvshl (bvand .cse9 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse10 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse9 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv11 32)))))) (let ((.cse11 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse1 (bvor .cse6 (bvor (bvshl (bvand .cse9 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv12 32)))))) (let ((.cse2 (bvor (bvor .cse1 (bvor (bvshl (bvand .cse9 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse9 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv14 32))))) (.cse3 (let ((.cse13 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse9 .cse13) .cse11) (bvshl (bvand .cse10 .cse13) ULTIMATE.start_main_~i~0))))) (or (and (= ULTIMATE.start_main_~z~0 .cse0) (= (_ bv9 32) ULTIMATE.start_main_~i~0)) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967284 32)) (_ bv0 32)) (= ULTIMATE.start_main_~z~0 .cse1)) (and (= ULTIMATE.start_main_~z~0 (bvor .cse2 .cse3)) (= (_ bv15 32) ULTIMATE.start_main_~i~0)) (and (= ULTIMATE.start_main_~z~0 (bvor .cse4 .cse3)) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967288 32)) (_ bv0 32))) (and (= (bvor .cse5 .cse3) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967294 32)) (_ bv0 32))) (and (= ULTIMATE.start_main_~z~0 .cse6) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967285 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= ULTIMATE.start_main_~z~0 .cse7)) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967282 32)) (_ bv0 32)) (= ULTIMATE.start_main_~z~0 .cse2)) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (= .cse8 ULTIMATE.start_main_~z~0)) (and (= (bvor .cse0 .cse3) ULTIMATE.start_main_~z~0) (= (_ bv10 32) ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~z~0 (bvor (bvor .cse2 (bvor (bvshl (bvand .cse9 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse9 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv16 32))))) (and (= .cse11 (_ bv0 32)) (= ULTIMATE.start_main_~z~0 .cse5)) (and (= ULTIMATE.start_main_~z~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32))) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= ULTIMATE.start_main_~z~0 (bvor .cse12 .cse3))) (and (= ULTIMATE.start_main_~z~0 .cse12) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= ULTIMATE.start_main_~z~0 (bvor .cse1 .cse3)) (= (_ bv13 32) ULTIMATE.start_main_~i~0)) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967289 32)) (_ bv0 32)) (= .cse4 ULTIMATE.start_main_~z~0))))))))))))) [2018-12-30 15:54:53,980 INFO L448 ceAbstractionStarter]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2018-12-30 15:54:53,981 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-30 15:54:54,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:54:54 BoogieIcfgContainer [2018-12-30 15:54:54,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:54:54,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:54:54,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:54:54,050 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:54:54,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:33" (3/4) ... [2018-12-30 15:54:54,055 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 15:54:54,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 15:54:54,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 15:54:54,132 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 15:54:54,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:54:54,133 INFO L168 Benchmark]: Toolchain (without parser) took 141810.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.5 MB). Free memory was 946.0 MB in the beginning and 869.8 MB in the end (delta: 76.2 MB). Peak memory consumption was 357.8 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,135 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:54:54,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.06 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:54:54,137 INFO L168 Benchmark]: Boogie Preprocessor took 120.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,137 INFO L168 Benchmark]: RCFGBuilder took 384.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,138 INFO L168 Benchmark]: TraceAbstraction took 140805.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 879.1 MB in the end (delta: 194.1 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,140 INFO L168 Benchmark]: Witness Printer took 82.60 ms. Allocated memory is still 1.3 GB. Free memory was 879.1 MB in the beginning and 869.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:54:54,147 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.06 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140805.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 879.1 MB in the end (delta: 194.1 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. * Witness Printer took 82.60 ms. Allocated memory is still 1.3 GB. Free memory was 879.1 MB in the beginning and 869.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))) && 9bv32 == i) || (~bvadd64(i, 4294967284bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 15bv32 == i)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && ~bvadd64(i, 4294967288bv32) == 0bv32)) || (~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967294bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) && ~bvadd64(i, 4294967285bv32) == 0bv32)) || (~bvadd64(i, 4294967290bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))))) || (~bvadd64(i, 4294967282bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))))) || (~bvadd64(i, 4294967291bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 10bv32 == i)) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32)))) || (~bvadd64(i, 4294967295bv32) == 0bv32 && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))))) || (z == 0bv32 && i == 0bv32)) || (~bvadd64(i, 4294967292bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))) && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 13bv32 == i)) || (~bvadd64(i, 4294967289bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))) == z) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 140.6s OverallTime, 5 OverallIterations, 16 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 40 SDslu, 38 SDs, 0 SdLazy, 545 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 126.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 2103 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1461 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 403 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 123.5s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 187578 SizeOfPredicates, 14 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...