./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_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/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_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/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-1dbac8b [2018-11-10 12:51:47,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:51:47,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:51:47,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:51:47,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:51:47,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:51:47,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:51:47,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:51:47,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:51:47,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:51:47,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:51:47,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:51:47,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:51:47,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:51:47,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:51:47,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:51:47,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:51:47,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:51:47,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:51:47,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:51:47,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:51:47,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:51:47,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:51:47,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:51:47,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:51:47,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:51:47,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:51:47,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:51:47,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:51:47,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:51:47,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:51:47,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:51:47,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:51:47,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:51:47,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:51:47,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:51:47,913 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:51:47,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:51:47,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:51:47,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:51:47,922 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:51:47,922 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:51:47,923 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:51:47,923 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:51:47,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:51:47,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:51:47,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:51:47,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:51:47,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:51:47,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:51:47,926 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:51:47,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:51:47,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:51:47,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:51:47,926 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_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/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-10 12:51:47,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:51:47,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:51:47,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:51:47,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:51:47,965 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:51:47,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-10 12:51:48,010 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/data/3e8b03cc8/f9f36ac4d2d2411a80b733cadcdf49af/FLAG43c932861 [2018-11-10 12:51:48,407 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:51:48,408 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-10 12:51:48,412 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/data/3e8b03cc8/f9f36ac4d2d2411a80b733cadcdf49af/FLAG43c932861 [2018-11-10 12:51:48,422 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/data/3e8b03cc8/f9f36ac4d2d2411a80b733cadcdf49af [2018-11-10 12:51:48,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:51:48,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:51:48,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:48,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:51:48,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:51:48,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dabf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48, skipping insertion in model container [2018-11-10 12:51:48,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:51:48,456 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:51:48,555 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:48,557 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:51:48,569 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:48,577 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:51:48,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48 WrapperNode [2018-11-10 12:51:48,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:48,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:51:48,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:51:48,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:51:48,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:51:48,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:51:48,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:51:48,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:51:48,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... [2018-11-10 12:51:48,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:51:48,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:51:48,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:51:48,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:51:48,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/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-10 12:51:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:51:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:51:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:51:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:51:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:51:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:51:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:51:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:51:48,828 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:51:48,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:48 BoogieIcfgContainer [2018-11-10 12:51:48,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:51:48,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:51:48,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:51:48,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:51:48,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:51:48" (1/3) ... [2018-11-10 12:51:48,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7501c71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:48, skipping insertion in model container [2018-11-10 12:51:48,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:48" (2/3) ... [2018-11-10 12:51:48,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7501c71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:48, skipping insertion in model container [2018-11-10 12:51:48,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:48" (3/3) ... [2018-11-10 12:51:48,835 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i [2018-11-10 12:51:48,842 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:51:48,848 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:51:48,860 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:51:48,884 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:51:48,884 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:51:48,884 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:51:48,884 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:51:48,884 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:51:48,884 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:51:48,885 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:51:48,885 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:51:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 12:51:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:51:48,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:48,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:48,904 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:48,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-10 12:51:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:48,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:48,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:48,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:48,977 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 12:51:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:48,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:51:48,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:48,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:51:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:51:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:51:48,991 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 12:51:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:49,008 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-10 12:51:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:51:49,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 12:51:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:49,014 INFO L225 Difference]: With dead ends: 39 [2018-11-10 12:51:49,014 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 12:51:49,016 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 12:51:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 12:51:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 12:51:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 12:51:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-10 12:51:49,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-10 12:51:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:49,038 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-10 12:51:49,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:51:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-10 12:51:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 12:51:49,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:49,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:49,039 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:49,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-10 12:51:49,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:49,093 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 12:51:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:49,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:49,094 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:49,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:51:49,095 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-10 12:51:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:49,158 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-10 12:51:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:49,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 12:51:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:49,160 INFO L225 Difference]: With dead ends: 30 [2018-11-10 12:51:49,160 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 12:51:49,160 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 12:51:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 12:51:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-10 12:51:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 12:51:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-10 12:51:49,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-10 12:51:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:49,167 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-10 12:51:49,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-10 12:51:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:49,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:49,168 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 12:51:49,168 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-10 12:51:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:49,240 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 12:51:49,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:49,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:49,241 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:49,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:49,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:49,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:51:49,242 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-10 12:51:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:49,320 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-10 12:51:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:49,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:51:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:49,322 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:51:49,322 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 12:51:49,322 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 12:51:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 12:51:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 12:51:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:51:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-10 12:51:49,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-10 12:51:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:49,327 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-10 12:51:49,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-10 12:51:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:49,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:49,328 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 12:51:49,328 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:49,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-10 12:51:49,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:49,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:49,568 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 12:51:49,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:49,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:51:49,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 12:51:49,570 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-10 12:51:49,614 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:51:49,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:51:49,683 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 12:51:50,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:51:50,115 INFO L272 AbstractInterpreter]: Visited 22 different actions 150 times. Merged at 13 different actions 102 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-10 12:51:50,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:50,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:51:50,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:50,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/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-10 12:51:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:50,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:51:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:50,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:50,195 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 12:51:50,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:51:52,623 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 12:51:52,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:51:52,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-10 12:51:52,645 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:51:52,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:51:52,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:51:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:51:52,646 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-10 12:51:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:52,790 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-10 12:51:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:51:52,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-10 12:51:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:52,792 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:51:52,793 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:51:52,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:51:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:51:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:51:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:51:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-10 12:51:52,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-10 12:51:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:52,799 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-10 12:51:52,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:51:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-10 12:51:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:52,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:52,800 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 12:51:52,800 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:52,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-10 12:51:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:52,801 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:54,836 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 12:51:54,839 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 12:51:54,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:54,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:54,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:54,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-10 12:51:54,841 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-10 12:51:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:54,844 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-10 12:51:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:54,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:51:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:54,845 INFO L225 Difference]: With dead ends: 65 [2018-11-10 12:51:54,845 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 12:51:54,845 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 12:51:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 12:51:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 12:51:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:51:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-10 12:51:54,850 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23 [2018-11-10 12:51:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:54,850 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-10 12:51:54,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-10 12:51:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:54,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:54,851 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 12:51:54,851 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:54,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash -299837096, now seen corresponding path program 1 times [2018-11-10 12:51:54,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:54,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:56,879 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 12:51:56,882 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 12:51:56,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:56,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:56,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:56,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-10 12:51:56,883 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 3 states. [2018-11-10 12:51:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:56,886 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-10 12:51:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:56,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:51:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:56,887 INFO L225 Difference]: With dead ends: 65 [2018-11-10 12:51:56,887 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 12:51:56,887 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 12:51:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 12:51:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 12:51:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:51:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-10 12:51:56,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23 [2018-11-10 12:51:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:56,891 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-10 12:51:56,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-10 12:51:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:56,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:56,892 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 12:51:56,892 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:56,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1310954346, now seen corresponding path program 1 times [2018-11-10 12:51:56,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:56,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:56,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:58,923 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 12:51:58,926 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 12:51:58,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:58,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:58,926 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:58,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-10 12:51:58,927 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2018-11-10 12:51:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:58,929 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-10 12:51:58,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:58,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:51:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:58,929 INFO L225 Difference]: With dead ends: 65 [2018-11-10 12:51:58,930 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 12:51:58,930 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 12:51:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 12:51:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 12:51:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:51:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-10 12:51:58,933 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2018-11-10 12:51:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:58,933 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-10 12:51:58,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-10 12:51:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:58,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:58,934 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 12:51:58,934 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:58,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1897760360, now seen corresponding path program 1 times [2018-11-10 12:51:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:58,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:58,976 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 12:51:58,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:58,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:58,977 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:51:58,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:51:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:58,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:51:58,977 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states. [2018-11-10 12:51:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:59,047 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-10 12:51:59,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:59,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:51:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:59,048 INFO L225 Difference]: With dead ends: 66 [2018-11-10 12:51:59,049 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:51:59,049 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 12:51:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:51:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:51:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:51:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-10 12:51:59,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-10 12:51:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:59,053 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 12:51:59,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:51:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-10 12:51:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:51:59,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:59,054 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 12:51:59,054 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:59,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-10 12:51:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:51:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:59,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:59,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:51:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:59,089 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:51:59,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:51:59 BoogieIcfgContainer [2018-11-10 12:51:59,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:51:59,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:51:59,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:51:59,111 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:51:59,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:48" (3/4) ... [2018-11-10 12:51:59,113 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:51:59,152 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1cf74d8e-3f13-4b46-89fb-ff968fadeb73/bin-2019/utaipan/witness.graphml [2018-11-10 12:51:59,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:51:59,153 INFO L168 Benchmark]: Toolchain (without parser) took 10728.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -80.2 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,154 INFO L168 Benchmark]: CDTParser took 0.15 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-10 12:51:59,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:59,155 INFO L168 Benchmark]: Boogie Preprocessor took 18.27 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,155 INFO L168 Benchmark]: RCFGBuilder took 220.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,156 INFO L168 Benchmark]: TraceAbstraction took 10279.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,156 INFO L168 Benchmark]: Witness Printer took 42.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:59,160 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.15 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 152.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.27 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10279.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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, 10.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, 80 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s 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.5s AbstIntTime, 1 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.0s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 22213 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...