./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 1dbac8bc
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer --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 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-1dbac8b
[2018-11-10 03:56:44,305 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-10 03:56:44,306 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-10 03:56:44,314 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-10 03:56:44,314 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-10 03:56:44,314 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-10 03:56:44,315 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-10 03:56:44,316 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-10 03:56:44,317 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-10 03:56:44,318 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-10 03:56:44,319 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-10 03:56:44,319 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-10 03:56:44,320 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-10 03:56:44,320 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-10 03:56:44,321 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-10 03:56:44,322 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-10 03:56:44,323 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-10 03:56:44,324 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-10 03:56:44,325 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-10 03:56:44,327 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-10 03:56:44,327 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-10 03:56:44,328 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-10 03:56:44,330 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-10 03:56:44,330 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-10 03:56:44,330 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-10 03:56:44,331 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-10 03:56:44,332 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-10 03:56:44,332 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-10 03:56:44,333 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-10 03:56:44,334 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-10 03:56:44,334 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-10 03:56:44,335 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-10 03:56:44,335 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-10 03:56:44,335 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-10 03:56:44,336 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-10 03:56:44,336 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-10 03:56:44,336 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf
[2018-11-10 03:56:44,346 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-10 03:56:44,346 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-10 03:56:44,347 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-10 03:56:44,347 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-11-10 03:56:44,348 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-10 03:56:44,348 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-10 03:56:44,348 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-10 03:56:44,348 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-10 03:56:44,348 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-10 03:56:44,348 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-10 03:56:44,348 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-10 03:56:44,349 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-10 03:56:44,349 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-10 03:56:44,351 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-10 03:56:44,351 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-10 03:56:44,352 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-10 03:56:44,352 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer
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 -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c
[2018-11-10 03:56:44,375 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-10 03:56:44,383 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-10 03:56:44,385 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-10 03:56:44,386 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-10 03:56:44,386 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-10 03:56:44,386 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-11-10 03:56:44,422 INFO  L218              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/data/8f468d37d/0f74e52a04ef4d91b5ead92347afa6b4/FLAG172e9a903
[2018-11-10 03:56:44,812 INFO  L298              CDTParser]: Found 1 translation units.
[2018-11-10 03:56:44,812 INFO  L158              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-11-10 03:56:44,816 INFO  L346              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/data/8f468d37d/0f74e52a04ef4d91b5ead92347afa6b4/FLAG172e9a903
[2018-11-10 03:56:44,825 INFO  L354              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/data/8f468d37d/0f74e52a04ef4d91b5ead92347afa6b4
[2018-11-10 03:56:44,827 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-10 03:56:44,827 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-11-10 03:56:44,828 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-10 03:56:44,828 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-10 03:56:44,830 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-10 03:56:44,831 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,832 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44, skipping insertion in model container
[2018-11-10 03:56:44,832 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,838 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-10 03:56:44,851 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-11-10 03:56:44,951 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 03:56:44,953 INFO  L189         MainTranslator]: Completed pre-run
[2018-11-10 03:56:44,968 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 03:56:44,977 INFO  L193         MainTranslator]: Completed translation
[2018-11-10 03:56:44,977 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44 WrapperNode
[2018-11-10 03:56:44,977 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-10 03:56:44,977 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-10 03:56:44,978 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-10 03:56:44,978 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-10 03:56:44,985 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,986 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,990 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,990 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,994 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:44,999 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:45,000 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
[2018-11-10 03:56:45,001 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-10 03:56:45,001 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-10 03:56:45,002 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-10 03:56:45,002 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-10 03:56:45,002 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/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-10 03:56:45,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-10 03:56:45,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-10 03:56:45,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2018-11-10 03:56:45,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-10 03:56:45,080 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-10 03:56:45,252 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-10 03:56:45,253 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:56:45 BoogieIcfgContainer
[2018-11-10 03:56:45,253 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-10 03:56:45,253 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-10 03:56:45,253 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-10 03:56:45,256 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-10 03:56:45,256 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:56:44" (1/3) ...
[2018-11-10 03:56:45,256 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62abb2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:56:45, skipping insertion in model container
[2018-11-10 03:56:45,256 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:56:44" (2/3) ...
[2018-11-10 03:56:45,257 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62abb2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:56:45, skipping insertion in model container
[2018-11-10 03:56:45,257 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:56:45" (3/3) ...
[2018-11-10 03:56:45,258 INFO  L112   eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i
[2018-11-10 03:56:45,264 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-10 03:56:45,269 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-10 03:56:45,279 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-10 03:56:45,301 INFO  L135   ementStrategyFactory]: Using default assertion order modulation
[2018-11-10 03:56:45,302 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-10 03:56:45,302 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-10 03:56:45,302 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-10 03:56:45,302 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-10 03:56:45,302 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-10 03:56:45,302 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-10 03:56:45,303 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-10 03:56:45,303 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-10 03:56:45,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states.
[2018-11-10 03:56:45,322 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-11-10 03:56:45,322 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:45,323 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 03:56:45,324 INFO  L424      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:45,329 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:45,329 INFO  L82        PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times
[2018-11-10 03:56:45,331 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:45,331 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:45,374 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,374 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:45,374 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:45,414 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-10 03:56:45,415 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:45,415 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-11-10 03:56:45,418 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-11-10 03:56:45,430 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-11-10 03:56:45,431 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-11-10 03:56:45,432 INFO  L87              Difference]: Start difference. First operand 28 states. Second operand 2 states.
[2018-11-10 03:56:45,446 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:45,446 INFO  L93              Difference]: Finished difference Result 39 states and 52 transitions.
[2018-11-10 03:56:45,446 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-11-10 03:56:45,447 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2018-11-10 03:56:45,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:45,455 INFO  L225             Difference]: With dead ends: 39
[2018-11-10 03:56:45,455 INFO  L226             Difference]: Without dead ends: 22
[2018-11-10 03:56:45,458 INFO  L605         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-10 03:56:45,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-11-10 03:56:45,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2018-11-10 03:56:45,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2018-11-10 03:56:45,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions.
[2018-11-10 03:56:45,487 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10
[2018-11-10 03:56:45,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:45,488 INFO  L481      AbstractCegarLoop]: Abstraction has 22 states and 32 transitions.
[2018-11-10 03:56:45,488 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-11-10 03:56:45,488 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions.
[2018-11-10 03:56:45,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-11-10 03:56:45,488 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:45,488 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 03:56:45,489 INFO  L424      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:45,489 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:45,489 INFO  L82        PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times
[2018-11-10 03:56:45,489 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:45,489 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:45,490 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,490 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:45,490 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:45,543 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-10 03:56:45,543 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:45,543 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:45,544 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:45,544 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:45,545 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 03:56:45,545 INFO  L87              Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states.
[2018-11-10 03:56:45,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:45,606 INFO  L93              Difference]: Finished difference Result 30 states and 41 transitions.
[2018-11-10 03:56:45,607 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:45,607 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2018-11-10 03:56:45,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:45,608 INFO  L225             Difference]: With dead ends: 30
[2018-11-10 03:56:45,609 INFO  L226             Difference]: Without dead ends: 25
[2018-11-10 03:56:45,609 INFO  L605         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-10 03:56:45,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2018-11-10 03:56:45,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24.
[2018-11-10 03:56:45,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2018-11-10 03:56:45,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions.
[2018-11-10 03:56:45,613 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11
[2018-11-10 03:56:45,613 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:45,613 INFO  L481      AbstractCegarLoop]: Abstraction has 24 states and 34 transitions.
[2018-11-10 03:56:45,613 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:45,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions.
[2018-11-10 03:56:45,613 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:45,614 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:45,614 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-10 03:56:45,614 INFO  L424      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:45,614 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:45,614 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times
[2018-11-10 03:56:45,614 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:45,614 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:45,615 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,616 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:45,616 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:45,684 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-10 03:56:45,684 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:45,684 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:45,684 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:45,684 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:45,684 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 03:56:45,685 INFO  L87              Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states.
[2018-11-10 03:56:45,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:45,759 INFO  L93              Difference]: Finished difference Result 54 states and 85 transitions.
[2018-11-10 03:56:45,759 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:45,759 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-10 03:56:45,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:45,761 INFO  L225             Difference]: With dead ends: 54
[2018-11-10 03:56:45,761 INFO  L226             Difference]: Without dead ends: 37
[2018-11-10 03:56:45,762 INFO  L605         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-10 03:56:45,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2018-11-10 03:56:45,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36.
[2018-11-10 03:56:45,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-11-10 03:56:45,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions.
[2018-11-10 03:56:45,768 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23
[2018-11-10 03:56:45,768 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:45,768 INFO  L481      AbstractCegarLoop]: Abstraction has 36 states and 47 transitions.
[2018-11-10 03:56:45,769 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:45,769 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2018-11-10 03:56:45,769 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:45,769 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:45,769 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-10 03:56:45,770 INFO  L424      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:45,770 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:45,770 INFO  L82        PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times
[2018-11-10 03:56:45,770 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:45,770 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:45,771 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,771 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:45,771 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:45,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:45,952 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-10 03:56:45,952 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-11-10 03:56:45,952 INFO  L225   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/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-10 03:56:45,967 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:45,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:45,986 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-10 03:56:46,026 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-10 03:56:46,048 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-11-10 03:56:46,048 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13
[2018-11-10 03:56:46,048 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-11-10 03:56:46,049 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-11-10 03:56:46,049 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2018-11-10 03:56:46,049 INFO  L87              Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states.
[2018-11-10 03:56:46,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:46,191 INFO  L93              Difference]: Finished difference Result 54 states and 66 transitions.
[2018-11-10 03:56:46,193 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-11-10 03:56:46,193 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 23
[2018-11-10 03:56:46,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:46,194 INFO  L225             Difference]: With dead ends: 54
[2018-11-10 03:56:46,194 INFO  L226             Difference]: Without dead ends: 49
[2018-11-10 03:56:46,194 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2018-11-10 03:56:46,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-11-10 03:56:46,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48.
[2018-11-10 03:56:46,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-10 03:56:46,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions.
[2018-11-10 03:56:46,199 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23
[2018-11-10 03:56:46,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:46,200 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 60 transitions.
[2018-11-10 03:56:46,200 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-11-10 03:56:46,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2018-11-10 03:56:46,201 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:46,201 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:46,201 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-10 03:56:46,201 INFO  L424      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:46,201 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:46,202 INFO  L82        PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times
[2018-11-10 03:56:46,202 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:46,202 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:46,202 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:46,203 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:46,203 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:46,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:48,225 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-10 03:56:48,228 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-10 03:56:48,229 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:48,229 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:48,229 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:48,229 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:48,230 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-10 03:56:48,230 INFO  L87              Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states.
[2018-11-10 03:56:48,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:48,234 INFO  L93              Difference]: Finished difference Result 65 states and 77 transitions.
[2018-11-10 03:56:48,234 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:48,234 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-10 03:56:48,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:48,235 INFO  L225             Difference]: With dead ends: 65
[2018-11-10 03:56:48,235 INFO  L226             Difference]: Without dead ends: 48
[2018-11-10 03:56:48,235 INFO  L605         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-10 03:56:48,235 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-10 03:56:48,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-10 03:56:48,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-10 03:56:48,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions.
[2018-11-10 03:56:48,240 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23
[2018-11-10 03:56:48,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:48,240 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 59 transitions.
[2018-11-10 03:56:48,240 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:48,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions.
[2018-11-10 03:56:48,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:48,241 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:48,241 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-10 03:56:48,241 INFO  L424      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:48,241 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:48,242 INFO  L82        PathProgramCache]: Analyzing trace with hash -299837096, now seen corresponding path program 1 times
[2018-11-10 03:56:48,242 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:48,242 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:48,242 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:48,243 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:48,243 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:48,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:50,284 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-10 03:56:50,288 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-10 03:56:50,288 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:50,288 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:50,289 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:50,289 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:50,289 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-10 03:56:50,289 INFO  L87              Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 3 states.
[2018-11-10 03:56:50,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:50,292 INFO  L93              Difference]: Finished difference Result 65 states and 76 transitions.
[2018-11-10 03:56:50,293 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:50,293 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-10 03:56:50,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:50,293 INFO  L225             Difference]: With dead ends: 65
[2018-11-10 03:56:50,293 INFO  L226             Difference]: Without dead ends: 48
[2018-11-10 03:56:50,298 INFO  L605         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-10 03:56:50,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-10 03:56:50,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-10 03:56:50,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-10 03:56:50,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions.
[2018-11-10 03:56:50,302 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23
[2018-11-10 03:56:50,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:50,302 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 58 transitions.
[2018-11-10 03:56:50,302 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:50,302 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions.
[2018-11-10 03:56:50,302 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:50,302 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:50,302 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-10 03:56:50,302 INFO  L424      AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:50,303 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:50,303 INFO  L82        PathProgramCache]: Analyzing trace with hash -1310954346, now seen corresponding path program 1 times
[2018-11-10 03:56:50,303 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:50,303 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:50,303 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:50,303 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:50,303 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:50,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:52,336 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-10 03:56:52,339 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-10 03:56:52,340 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:52,340 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:52,340 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:52,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:52,340 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-10 03:56:52,340 INFO  L87              Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states.
[2018-11-10 03:56:52,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:52,342 INFO  L93              Difference]: Finished difference Result 65 states and 75 transitions.
[2018-11-10 03:56:52,342 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:52,343 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-10 03:56:52,343 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:52,343 INFO  L225             Difference]: With dead ends: 65
[2018-11-10 03:56:52,343 INFO  L226             Difference]: Without dead ends: 48
[2018-11-10 03:56:52,343 INFO  L605         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-10 03:56:52,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-10 03:56:52,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-10 03:56:52,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-10 03:56:52,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions.
[2018-11-10 03:56:52,348 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23
[2018-11-10 03:56:52,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:52,348 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 57 transitions.
[2018-11-10 03:56:52,348 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:52,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions.
[2018-11-10 03:56:52,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:52,349 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:52,349 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-10 03:56:52,349 INFO  L424      AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:52,349 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:52,349 INFO  L82        PathProgramCache]: Analyzing trace with hash -1897760360, now seen corresponding path program 1 times
[2018-11-10 03:56:52,349 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:52,349 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:52,350 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:52,350 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:52,350 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:52,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 03:56:52,397 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-10 03:56:52,397 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 03:56:52,397 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 03:56:52,397 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-10 03:56:52,397 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 03:56:52,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 03:56:52,398 INFO  L87              Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states.
[2018-11-10 03:56:52,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 03:56:52,459 INFO  L93              Difference]: Finished difference Result 66 states and 75 transitions.
[2018-11-10 03:56:52,460 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 03:56:52,460 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-10 03:56:52,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 03:56:52,460 INFO  L225             Difference]: With dead ends: 66
[2018-11-10 03:56:52,461 INFO  L226             Difference]: Without dead ends: 49
[2018-11-10 03:56:52,461 INFO  L605         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-10 03:56:52,461 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-11-10 03:56:52,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48.
[2018-11-10 03:56:52,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-10 03:56:52,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2018-11-10 03:56:52,464 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23
[2018-11-10 03:56:52,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 03:56:52,465 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2018-11-10 03:56:52,465 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-10 03:56:52,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2018-11-10 03:56:52,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-10 03:56:52,465 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 03:56:52,466 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-10 03:56:52,466 INFO  L424      AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-10 03:56:52,466 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 03:56:52,466 INFO  L82        PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times
[2018-11-10 03:56:52,466 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 03:56:52,466 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 03:56:52,467 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:52,467 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 03:56:52,467 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 03:56:52,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 03:56:52,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 03:56:52,507 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-11-10 03:56:52,528 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:56:52 BoogieIcfgContainer
[2018-11-10 03:56:52,528 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-10 03:56:52,528 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-10 03:56:52,529 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-10 03:56:52,529 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-10 03:56:52,529 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:56:45" (3/4) ...
[2018-11-10 03:56:52,531 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-11-10 03:56:52,569 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e268ce39-e730-4817-b067-b0047da9b347/bin-2019/uautomizer/witness.graphml
[2018-11-10 03:56:52,570 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-10 03:56:52,570 INFO  L168              Benchmark]: Toolchain (without parser) took 7743.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 959.1 MB in the beginning and 997.9 MB in the end (delta: -38.8 MB). Peak memory consumption was 132.7 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,572 INFO  L168              Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,572 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 149.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,573 INFO  L168              Benchmark]: Boogie Preprocessor took 23.70 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,573 INFO  L168              Benchmark]: RCFGBuilder took 251.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,573 INFO  L168              Benchmark]: TraceAbstraction took 7274.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,574 INFO  L168              Benchmark]: Witness Printer took 41.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB.
[2018-11-10 03:56:52,576 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 149.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 23.70 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 251.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 7274.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB.
 * Witness Printer took 41.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. 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, 7.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 20 SDslu, 172 SDs, 0 SdLazy, 352 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s 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.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 19969 SizeOfPredicates, 1 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...