./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.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_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/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 a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:10:02,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:10:02,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:10:02,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:10:02,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:10:02,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:10:02,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:10:02,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:10:02,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:10:02,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:10:02,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:10:02,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:10:02,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:10:02,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:10:02,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:10:02,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:10:02,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:10:02,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:10:02,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:10:02,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:10:02,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:10:02,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:10:02,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:10:02,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:10:02,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:10:02,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:10:02,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:10:02,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:10:02,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:10:02,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:10:02,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:10:02,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:10:02,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:10:02,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:10:02,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:10:02,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:10:02,085 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:10:02,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:10:02,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:10:02,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:10:02,093 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:10:02,093 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:10:02,093 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:10:02,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:10:02,094 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:10:02,094 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:10:02,094 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:10:02,094 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:10:02,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:10:02,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:10:02,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:10:02,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:10:02,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:10:02,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:10:02,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:10:02,098 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_82e08be1-fca4-457e-b052-0aed45197d61/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 -> a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 [2018-11-10 12:10:02,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:10:02,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:10:02,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:10:02,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:10:02,134 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:10:02,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/../../sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i [2018-11-10 12:10:02,181 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/data/56f806ef4/15f5c8fdb33a4e509fd41bd2f5cd2088/FLAG40217ab33 [2018-11-10 12:10:02,578 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:10:02,578 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i [2018-11-10 12:10:02,583 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/data/56f806ef4/15f5c8fdb33a4e509fd41bd2f5cd2088/FLAG40217ab33 [2018-11-10 12:10:02,593 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/data/56f806ef4/15f5c8fdb33a4e509fd41bd2f5cd2088 [2018-11-10 12:10:02,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:10:02,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:10:02,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:10:02,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:10:02,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:10:02,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@837b16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02, skipping insertion in model container [2018-11-10 12:10:02,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:10:02,624 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:10:02,718 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:10:02,721 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:10:02,730 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:10:02,738 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:10:02,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02 WrapperNode [2018-11-10 12:10:02,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:10:02,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:10:02,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:10:02,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:10:02,744 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:10:02" (1/1) ... [2018-11-10 12:10:02,747 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:10:02" (1/1) ... [2018-11-10 12:10:02,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:10:02,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:10:02,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:10:02,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:10:02,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... [2018-11-10 12:10:02,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:10:02,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:10:02,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:10:02,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:10:02,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/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:10:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:10:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:10:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:10:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:10:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:10:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:10:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:10:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:10:02,941 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:10:02,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:02 BoogieIcfgContainer [2018-11-10 12:10:02,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:10:02,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:10:02,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:10:02,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:10:02,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:10:02" (1/3) ... [2018-11-10 12:10:02,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ddfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:10:02, skipping insertion in model container [2018-11-10 12:10:02,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:02" (2/3) ... [2018-11-10 12:10:02,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ddfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:10:02, skipping insertion in model container [2018-11-10 12:10:02,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:02" (3/3) ... [2018-11-10 12:10:02,948 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-11-10 12:10:02,955 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:10:02,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:10:02,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:10:03,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:10:03,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:10:03,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:10:03,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:10:03,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:10:03,000 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:10:03,000 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:10:03,000 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:10:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-10 12:10:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:10:03,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:03,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:03,020 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:03,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1231955355, now seen corresponding path program 1 times [2018-11-10 12:10:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:03,198 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:10:03,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:10:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:10:03,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:10:03,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:10:03,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:10:03,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:10:03,211 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-11-10 12:10:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:03,278 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-10 12:10:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:10:03,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-10 12:10:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:03,285 INFO L225 Difference]: With dead ends: 41 [2018-11-10 12:10:03,285 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 12:10:03,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:10:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 12:10:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-10 12:10:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 12:10:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-10 12:10:03,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-10 12:10:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:03,313 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 12:10:03,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:10:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-10 12:10:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:10:03,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:03,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:03,314 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:03,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1174697053, now seen corresponding path program 1 times [2018-11-10 12:10:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:03,362 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:10:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:10:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:10:03,363 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:10:03,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:10:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:10:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:10:03,365 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-11-10 12:10:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:03,401 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-10 12:10:03,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:10:03,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 12:10:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:03,404 INFO L225 Difference]: With dead ends: 39 [2018-11-10 12:10:03,404 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 12:10:03,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:10:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 12:10:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 12:10:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 12:10:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 12:10:03,411 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2018-11-10 12:10:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:03,411 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 12:10:03,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:10:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 12:10:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:10:03,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:03,412 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:03,412 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:03,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash -494238111, now seen corresponding path program 1 times [2018-11-10 12:10:03,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:03,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:10:03,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:03,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:03,480 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-10 12:10:03,482 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [19], [21], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2018-11-10 12:10:03,511 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:10:03,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:10:03,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 12:10:03,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:10:03,911 INFO L272 AbstractInterpreter]: Visited 17 different actions 331 times. Merged at 6 different actions 113 times. Widened at 1 different actions 13 times. Found 17 fixpoints after 2 different actions. Largest state had 7 variables. [2018-11-10 12:10:03,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:03,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:10:03,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:03,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/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:10:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:03,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:10:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:03,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:10:03,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:10:04,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 12:10:04,008 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:04,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:10:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:10:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:10:04,009 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2018-11-10 12:10:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:04,027 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-10 12:10:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:10:04,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-10 12:10:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:04,028 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:10:04,028 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 12:10:04,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:10:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 12:10:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 12:10:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 12:10:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-10 12:10:04,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-11-10 12:10:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:04,038 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 12:10:04,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:10:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-10 12:10:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:10:04,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:04,040 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:04,040 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:04,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2135506589, now seen corresponding path program 2 times [2018-11-10 12:10:04,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:10:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:04,109 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:04,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:04,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:04,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:10:04,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:10:04,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 12:10:04,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:04,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:10:04,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:10:04,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:04,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 12:10:04,314 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:04,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:10:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:10:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:10:04,315 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-10 12:10:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:04,342 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-10 12:10:04,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:10:04,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-10 12:10:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:04,343 INFO L225 Difference]: With dead ends: 50 [2018-11-10 12:10:04,344 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 12:10:04,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:10:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 12:10:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-10 12:10:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 12:10:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-10 12:10:04,350 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2018-11-10 12:10:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:04,351 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-10 12:10:04,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:10:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-10 12:10:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:10:04,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:04,352 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:04,352 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:04,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash -374355807, now seen corresponding path program 3 times [2018-11-10 12:10:04,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:10:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:04,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:04,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:10:04,451 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 12:10:04,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:10:04,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:04,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:10:04,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:10:04,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:04,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-10 12:10:04,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:04,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:10:04,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:10:04,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:10:04,577 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-10 12:10:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:04,614 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-10 12:10:04,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:10:04,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-10 12:10:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:04,616 INFO L225 Difference]: With dead ends: 55 [2018-11-10 12:10:04,616 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 12:10:04,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:10:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 12:10:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-10 12:10:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 12:10:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-10 12:10:04,623 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-11-10 12:10:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:04,624 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 12:10:04,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:10:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-10 12:10:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 12:10:04,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:04,625 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:04,625 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1263007965, now seen corresponding path program 4 times [2018-11-10 12:10:04,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:04,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:04,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:10:04,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:04,712 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:04,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:04,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:04,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:04,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:10:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:04,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:10:04,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:10:04,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:04,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-10 12:10:04,866 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:04,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:10:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:10:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:10:04,867 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-11-10 12:10:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:04,917 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-10 12:10:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:10:04,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-10 12:10:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:04,918 INFO L225 Difference]: With dead ends: 60 [2018-11-10 12:10:04,918 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:10:04,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:10:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:10:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:10:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:10:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 12:10:04,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 49 [2018-11-10 12:10:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:04,924 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 12:10:04,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:10:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 12:10:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 12:10:04,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:04,925 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:04,925 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1453262111, now seen corresponding path program 5 times [2018-11-10 12:10:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:04,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 12:10:05,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:05,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:05,026 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:05,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:05,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:05,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:05,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:10:05,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:10:06,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 12:10:06,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:06,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 23 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 12:10:06,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 23 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 12:10:07,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:07,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 14] total 26 [2018-11-10 12:10:07,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:07,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:10:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:10:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-11-10 12:10:07,515 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 15 states. [2018-11-10 12:10:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:07,632 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-10 12:10:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:10:07,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-11-10 12:10:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:07,634 INFO L225 Difference]: With dead ends: 67 [2018-11-10 12:10:07,634 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:10:07,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-11-10 12:10:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:10:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-10 12:10:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 12:10:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-10 12:10:07,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 58 [2018-11-10 12:10:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:07,639 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-10 12:10:07,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:10:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-10 12:10:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 12:10:07,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:07,640 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:07,641 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:07,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1989893347, now seen corresponding path program 6 times [2018-11-10 12:10:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:07,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:07,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:10:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:07,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:07,723 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:07,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:07,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:10:07,731 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 12:10:07,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:10:07,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:07,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:10:07,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:10:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:07,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-10 12:10:07,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:07,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:10:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:10:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:10:07,908 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-11-10 12:10:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:07,971 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-10 12:10:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:10:07,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-10 12:10:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:07,973 INFO L225 Difference]: With dead ends: 70 [2018-11-10 12:10:07,973 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 12:10:07,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:10:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 12:10:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-10 12:10:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 12:10:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-10 12:10:07,979 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 67 [2018-11-10 12:10:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:07,979 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-10 12:10:07,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:10:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-10 12:10:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:10:07,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:07,980 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:07,981 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:07,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash -259908319, now seen corresponding path program 7 times [2018-11-10 12:10:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:07,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:07,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 12:10:08,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:08,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:08,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:08,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:08,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:08,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:08,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:08,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:10:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:08,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 12:10:08,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 12:10:08,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:08,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-10 12:10:08,285 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:08,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:10:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:10:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:10:08,286 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 10 states. [2018-11-10 12:10:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:08,373 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-10 12:10:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:10:08,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-11-10 12:10:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:08,374 INFO L225 Difference]: With dead ends: 75 [2018-11-10 12:10:08,374 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 12:10:08,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:10:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 12:10:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-10 12:10:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 12:10:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-10 12:10:08,380 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 76 [2018-11-10 12:10:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:08,381 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-10 12:10:08,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:10:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-10 12:10:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 12:10:08,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:08,384 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:08,384 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2013053603, now seen corresponding path program 8 times [2018-11-10 12:10:08,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:10:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:08,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 12:10:08,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:08,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:08,492 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:08,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:08,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:08,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:10:08,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:10:13,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-10 12:10:13,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:13,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 12:10:13,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 12:10:13,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:13,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-10 12:10:13,414 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:13,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:10:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:10:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:10:13,415 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 11 states. [2018-11-10 12:10:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:13,519 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-10 12:10:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:10:13,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-10 12:10:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:13,521 INFO L225 Difference]: With dead ends: 80 [2018-11-10 12:10:13,521 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 12:10:13,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:10:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 12:10:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-10 12:10:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 12:10:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-10 12:10:13,527 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 85 [2018-11-10 12:10:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:13,527 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-10 12:10:13,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:10:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-10 12:10:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:10:13,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:13,528 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:13,528 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:13,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 485961569, now seen corresponding path program 9 times [2018-11-10 12:10:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:13,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:13,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:10:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 12:10:13,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:13,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:10:13,636 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:10:13,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:10:13,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:10:13,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:10:13,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:10:13,646 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 12:10:13,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:10:13,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:10:13,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:10:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 12:10:13,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:10:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 12:10:13,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:10:13,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-10 12:10:13,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:10:13,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:10:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:10:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:10:13,907 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 12 states. [2018-11-10 12:10:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:10:14,041 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2018-11-10 12:10:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:10:14,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-10 12:10:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:10:14,042 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:10:14,042 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:10:14,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:10:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:10:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-10 12:10:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 12:10:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-10 12:10:14,046 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 94 [2018-11-10 12:10:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:10:14,046 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-10 12:10:14,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:10:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-10 12:10:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:10:14,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:10:14,047 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:10:14,047 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:10:14,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:10:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1149749149, now seen corresponding path program 10 times [2018-11-10 12:10:14,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:10:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:14,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:10:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:10:14,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:10:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:10:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:10:14,107 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:10:14,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:10:14 BoogieIcfgContainer [2018-11-10 12:10:14,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:10:14,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:10:14,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:10:14,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:10:14,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:02" (3/4) ... [2018-11-10 12:10:14,138 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:10:14,186 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_82e08be1-fca4-457e-b052-0aed45197d61/bin-2019/utaipan/witness.graphml [2018-11-10 12:10:14,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:10:14,188 INFO L168 Benchmark]: Toolchain (without parser) took 11592.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 472.4 kB. Max. memory is 11.5 GB. [2018-11-10 12:10:14,189 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:10:14,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 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:10:14,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.30 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:10:14,190 INFO L168 Benchmark]: Boogie Preprocessor took 12.15 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:10:14,190 INFO L168 Benchmark]: RCFGBuilder took 178.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:10:14,190 INFO L168 Benchmark]: TraceAbstraction took 11193.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:10:14,191 INFO L168 Benchmark]: Witness Printer took 51.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:10:14,192 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.30 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.15 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11193.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Witness Printer took 51.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 11.1s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 28 SDslu, 1681 SDs, 0 SdLazy, 1338 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1131 GetRequests, 982 SyntacticMatches, 19 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 433008 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 1962/4185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...