./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:49:09,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:49:09,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:49:09,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:49:09,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:49:09,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:49:09,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:49:09,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:49:09,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:49:09,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:49:09,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:49:09,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:49:09,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:49:09,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:49:09,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:49:09,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:49:09,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:49:09,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:49:09,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:49:09,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:49:09,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:49:09,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:49:09,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:49:09,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:49:09,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:49:09,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:49:09,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:49:09,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:49:09,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:49:09,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:49:09,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:49:09,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:49:09,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:49:09,582 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:49:09,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:49:09,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:49:09,583 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:49:09,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:49:09,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:49:09,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:49:09,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:49:09,593 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:49:09,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:49:09,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:49:09,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:49:09,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:49:09,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:49:09,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:49:09,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:49:09,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:09,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:49:09,597 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c [2018-11-18 16:49:09,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:49:09,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:49:09,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:49:09,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:49:09,635 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:49:09,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-18 16:49:09,679 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/data/3634e9a67/aaac5dbc8c724e86815f8060852d0756/FLAG6030244f8 [2018-11-18 16:49:10,084 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:49:10,084 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-18 16:49:10,089 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/data/3634e9a67/aaac5dbc8c724e86815f8060852d0756/FLAG6030244f8 [2018-11-18 16:49:10,099 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/data/3634e9a67/aaac5dbc8c724e86815f8060852d0756 [2018-11-18 16:49:10,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:49:10,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:49:10,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:10,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:49:10,104 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:49:10,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4546e68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10, skipping insertion in model container [2018-11-18 16:49:10,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:49:10,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:49:10,240 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:10,242 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:49:10,256 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:10,264 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:49:10,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10 WrapperNode [2018-11-18 16:49:10,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:10,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:10,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:49:10,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:49:10,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:10,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:49:10,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:49:10,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:49:10,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... [2018-11-18 16:49:10,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:49:10,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:49:10,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:49:10,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:49:10,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:49:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:49:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:49:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:49:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:49:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:49:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:49:10,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:49:10,522 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:49:10,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:10 BoogieIcfgContainer [2018-11-18 16:49:10,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:49:10,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:49:10,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:49:10,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:49:10,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:49:10" (1/3) ... [2018-11-18 16:49:10,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b4247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:10, skipping insertion in model container [2018-11-18 16:49:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:10" (2/3) ... [2018-11-18 16:49:10,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b4247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:10, skipping insertion in model container [2018-11-18 16:49:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:10" (3/3) ... [2018-11-18 16:49:10,529 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i [2018-11-18 16:49:10,537 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:49:10,542 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:49:10,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:49:10,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:49:10,569 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:49:10,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:49:10,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:49:10,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:49:10,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:49:10,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:49:10,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:49:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-18 16:49:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:49:10,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:10,586 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:10,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:10,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-18 16:49:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:10,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:10,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:10,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:49:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:49:10,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:49:10,670 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-18 16:49:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:10,682 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-18 16:49:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:49:10,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 16:49:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:10,688 INFO L225 Difference]: With dead ends: 39 [2018-11-18 16:49:10,688 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 16:49:10,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:49:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 16:49:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 16:49:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 16:49:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-18 16:49:10,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-18 16:49:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:10,711 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-18 16:49:10,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:49:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-18 16:49:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:49:10,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:10,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:10,712 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:10,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-18 16:49:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:10,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:10,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:10,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:10,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:10,791 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-18 16:49:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:10,855 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-18 16:49:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:10,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 16:49:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:10,858 INFO L225 Difference]: With dead ends: 30 [2018-11-18 16:49:10,858 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 16:49:10,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 16:49:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-18 16:49:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 16:49:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-18 16:49:10,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-18 16:49:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:10,863 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-18 16:49:10,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-18 16:49:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:10,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:10,864 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:10,865 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:10,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-18 16:49:10,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:10,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:10,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:10,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:10,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:10,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:10,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:10,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:10,943 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-18 16:49:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:11,036 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-18 16:49:11,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:11,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:49:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:11,038 INFO L225 Difference]: With dead ends: 54 [2018-11-18 16:49:11,038 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 16:49:11,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 16:49:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-18 16:49:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 16:49:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-18 16:49:11,044 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-18 16:49:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:11,044 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-18 16:49:11,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-18 16:49:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:11,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:11,045 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:11,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-18 16:49:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:11,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:11,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:11,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:49:11,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-18 16:49:11,229 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-11-18 16:49:11,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:49:11,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:49:11,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:49:11,517 INFO L272 AbstractInterpreter]: Visited 22 different actions 57 times. Merged at 13 different actions 29 times. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 13. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-18 16:49:11,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:11,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:49:11,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:11,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/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-11-18 16:49:11,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:11,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:49:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:11,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:11,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:49:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:12,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:49:12,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-18 16:49:12,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:49:12,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:49:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:49:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:49:12,461 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 14 states. [2018-11-18 16:49:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:12,603 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-18 16:49:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:49:12,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-18 16:49:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:12,604 INFO L225 Difference]: With dead ends: 55 [2018-11-18 16:49:12,604 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 16:49:12,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:49:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 16:49:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 16:49:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:49:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-18 16:49:12,610 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-18 16:49:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:12,610 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-18 16:49:12,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:49:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-18 16:49:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:12,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:12,611 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:12,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:12,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-18 16:49:12,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:12,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:12,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:14,637 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-18 16:49:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:14,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:14,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:14,641 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-18 16:49:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:14,644 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-18 16:49:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:14,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:49:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:14,645 INFO L225 Difference]: With dead ends: 65 [2018-11-18 16:49:14,645 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:49:14,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:49:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 16:49:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:49:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-18 16:49:14,650 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23 [2018-11-18 16:49:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:14,651 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-18 16:49:14,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-18 16:49:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:14,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:14,652 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:14,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:14,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash -299837096, now seen corresponding path program 1 times [2018-11-18 16:49:14,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:14,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:14,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:16,684 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-18 16:49:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:16,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:16,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:16,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:16,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:16,688 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 3 states. [2018-11-18 16:49:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:16,690 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-18 16:49:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:16,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:49:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:16,691 INFO L225 Difference]: With dead ends: 65 [2018-11-18 16:49:16,691 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:49:16,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:49:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 16:49:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:49:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-18 16:49:16,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23 [2018-11-18 16:49:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:16,695 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 16:49:16,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 16:49:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:16,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:16,695 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:16,696 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:16,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1310954346, now seen corresponding path program 1 times [2018-11-18 16:49:16,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:16,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:18,738 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-18 16:49:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:18,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:18,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:18,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:18,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:18,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:18,741 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2018-11-18 16:49:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:18,743 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-18 16:49:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:18,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:49:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:18,744 INFO L225 Difference]: With dead ends: 65 [2018-11-18 16:49:18,744 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:49:18,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-18 16:49:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:49:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 16:49:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:49:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-18 16:49:18,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2018-11-18 16:49:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:18,749 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-18 16:49:18,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-18 16:49:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:18,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:18,750 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:18,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:18,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1897760360, now seen corresponding path program 1 times [2018-11-18 16:49:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:18,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:18,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:18,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:18,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:18,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:18,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:18,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:18,795 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states. [2018-11-18 16:49:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:18,840 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-18 16:49:18,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:18,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:49:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:18,840 INFO L225 Difference]: With dead ends: 66 [2018-11-18 16:49:18,840 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 16:49:18,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 16:49:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-18 16:49:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:49:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-18 16:49:18,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-18 16:49:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:18,843 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-18 16:49:18,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-18 16:49:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:18,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:18,844 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:18,844 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:18,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-18 16:49:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:18,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:18,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:49:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:49:18,875 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:49:18,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:49:18 BoogieIcfgContainer [2018-11-18 16:49:18,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:49:18,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:49:18,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:49:18,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:49:18,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:10" (3/4) ... [2018-11-18 16:49:18,894 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:49:18,920 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7fb999b7-9a36-4785-a39e-e3ad9f585124/bin-2019/utaipan/witness.graphml [2018-11-18 16:49:18,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:49:18,921 INFO L168 Benchmark]: Toolchain (without parser) took 8819.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 959.2 MB in the beginning and 883.4 MB in the end (delta: 75.9 MB). Peak memory consumption was 230.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:18,922 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:49:18,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:18,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.51 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:18,922 INFO L168 Benchmark]: Boogie Preprocessor took 15.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:49:18,922 INFO L168 Benchmark]: RCFGBuilder took 228.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:18,923 INFO L168 Benchmark]: TraceAbstraction took 8367.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.4 MB in the end (delta: 251.5 MB). Peak memory consumption was 251.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:18,923 INFO L168 Benchmark]: Witness Printer took 28.72 ms. Allocated memory is still 1.2 GB. Free memory is still 883.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:49:18,924 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 13.51 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 228.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8367.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.4 MB in the end (delta: 251.5 MB). Peak memory consumption was 251.5 MB. Max. memory is 11.5 GB. * Witness Printer took 28.72 ms. Allocated memory is still 1.2 GB. Free memory is still 883.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. UNSAFE Result, 8.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 22 SDslu, 157 SDs, 0 SdLazy, 341 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 22389 SizeOfPredicates, 1 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...