java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label45_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:21:28,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:21:28,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:21:28,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:21:28,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:21:28,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:21:28,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:21:28,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:21:28,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:21:28,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:21:28,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:21:28,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:21:28,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:21:28,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:21:28,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:21:28,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:21:28,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:21:28,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:21:28,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:21:28,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:21:28,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:21:28,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:21:28,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:21:28,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:21:28,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:21:28,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:21:28,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:21:28,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:21:28,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:21:28,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:21:28,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:21:28,827 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:21:28,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:21:28,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:21:28,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:21:28,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:21:28,829 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:21:28,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:21:28,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:21:28,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:21:28,852 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:21:28,852 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:21:28,852 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:21:28,852 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:21:28,853 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:21:28,853 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:21:28,853 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:21:28,853 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:21:28,853 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:21:28,854 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:21:28,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:21:28,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:21:28,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:21:28,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:21:28,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:21:28,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:21:28,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:21:28,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:21:28,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:21:28,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:21:28,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:21:28,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:21:28,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:21:28,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:21:28,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:21:28,858 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:21:28,858 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:21:28,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:21:28,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:21:28,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:21:28,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:21:28,936 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:21:28,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label45_true-unreach-call.c [2018-11-07 20:21:29,004 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598815faf/20a25f0372df4629bac3f0c6f412420c/FLAGfd3757a8a [2018-11-07 20:21:29,722 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:21:29,722 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label45_true-unreach-call.c [2018-11-07 20:21:29,755 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598815faf/20a25f0372df4629bac3f0c6f412420c/FLAGfd3757a8a [2018-11-07 20:21:29,776 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598815faf/20a25f0372df4629bac3f0c6f412420c [2018-11-07 20:21:29,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:21:29,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:21:29,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:21:29,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:21:29,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:21:29,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:21:29" (1/1) ... [2018-11-07 20:21:29,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca984c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:29, skipping insertion in model container [2018-11-07 20:21:29,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:21:29" (1/1) ... [2018-11-07 20:21:29,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:21:29,988 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:21:31,434 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:21:31,438 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:21:32,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:21:32,079 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:21:32,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32 WrapperNode [2018-11-07 20:21:32,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:21:32,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:21:32,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:21:32,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:21:32,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:21:32,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:21:32,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:21:32,415 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:21:32,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... [2018-11-07 20:21:32,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:21:32,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:21:32,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:21:32,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:21:32,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:21:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:21:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:21:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:21:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:21:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:21:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:21:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:21:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:21:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:21:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:21:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:21:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:21:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:21:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:21:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:21:42,428 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:21:42,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:21:42 BoogieIcfgContainer [2018-11-07 20:21:42,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:21:42,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:21:42,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:21:42,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:21:42,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:21:29" (1/3) ... [2018-11-07 20:21:42,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd40674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:21:42, skipping insertion in model container [2018-11-07 20:21:42,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:21:32" (2/3) ... [2018-11-07 20:21:42,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd40674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:21:42, skipping insertion in model container [2018-11-07 20:21:42,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:21:42" (3/3) ... [2018-11-07 20:21:42,438 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label45_true-unreach-call.c [2018-11-07 20:21:42,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:21:42,464 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:21:42,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:21:42,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:21:42,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:21:42,540 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:21:42,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:21:42,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:21:42,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:21:42,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:21:42,541 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:21:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-07 20:21:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 20:21:42,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:21:42,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:21:42,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:21:42,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:21:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -427450892, now seen corresponding path program 1 times [2018-11-07 20:21:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:21:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:21:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:21:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:21:42,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:21:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:21:43,317 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:21:43,453 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-07 20:21:43,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:21:43,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:21:43,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:21:43,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:21:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:21:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:21:43,487 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-11-07 20:21:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:21:50,827 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-11-07 20:21:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:21:50,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-07 20:21:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:21:50,879 INFO L225 Difference]: With dead ends: 2446 [2018-11-07 20:21:50,879 INFO L226 Difference]: Without dead ends: 1604 [2018-11-07 20:21:50,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:21:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-07 20:21:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-07 20:21:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-07 20:21:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-11-07 20:21:51,058 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 58 [2018-11-07 20:21:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:21:51,059 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-11-07 20:21:51,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:21:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-11-07 20:21:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 20:21:51,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:21:51,071 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:21:51,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:21:51,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:21:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1706095754, now seen corresponding path program 1 times [2018-11-07 20:21:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:21:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:21:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:21:51,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:21:51,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:21:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:21:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:21:51,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:21:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:21:51,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:21:51,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:21:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:21:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:21:51,439 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 4 states. [2018-11-07 20:22:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:06,269 INFO L93 Difference]: Finished difference Result 6274 states and 11428 transitions. [2018-11-07 20:22:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:22:06,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-07 20:22:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:06,313 INFO L225 Difference]: With dead ends: 6274 [2018-11-07 20:22:06,313 INFO L226 Difference]: Without dead ends: 4676 [2018-11-07 20:22:06,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:22:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-11-07 20:22:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4676. [2018-11-07 20:22:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-11-07 20:22:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7980 transitions. [2018-11-07 20:22:06,503 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7980 transitions. Word has length 134 [2018-11-07 20:22:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:22:06,504 INFO L480 AbstractCegarLoop]: Abstraction has 4676 states and 7980 transitions. [2018-11-07 20:22:06,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:22:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7980 transitions. [2018-11-07 20:22:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 20:22:06,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:22:06,604 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:22:06,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:22:06,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1738242550, now seen corresponding path program 1 times [2018-11-07 20:22:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:22:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:06,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:22:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:06,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:22:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:22:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:22:07,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:22:07,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:22:07,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:22:07,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:22:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:22:07,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:22:07,127 INFO L87 Difference]: Start difference. First operand 4676 states and 7980 transitions. Second operand 6 states. [2018-11-07 20:22:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:17,665 INFO L93 Difference]: Finished difference Result 14179 states and 24917 transitions. [2018-11-07 20:22:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:22:17,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-07 20:22:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:17,743 INFO L225 Difference]: With dead ends: 14179 [2018-11-07 20:22:17,743 INFO L226 Difference]: Without dead ends: 9509 [2018-11-07 20:22:17,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:22:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9509 states. [2018-11-07 20:22:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9509 to 9424. [2018-11-07 20:22:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9424 states. [2018-11-07 20:22:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9424 states to 9424 states and 15810 transitions. [2018-11-07 20:22:18,170 INFO L78 Accepts]: Start accepts. Automaton has 9424 states and 15810 transitions. Word has length 172 [2018-11-07 20:22:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:22:18,171 INFO L480 AbstractCegarLoop]: Abstraction has 9424 states and 15810 transitions. [2018-11-07 20:22:18,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:22:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9424 states and 15810 transitions. [2018-11-07 20:22:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 20:22:18,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:22:18,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:22:18,179 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:22:18,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1389226247, now seen corresponding path program 1 times [2018-11-07 20:22:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:22:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:18,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:22:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:18,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:22:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:22:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:22:18,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:22:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:22:18,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:22:18,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:22:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:22:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:22:18,644 INFO L87 Difference]: Start difference. First operand 9424 states and 15810 transitions. Second operand 6 states. [2018-11-07 20:22:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:33,382 INFO L93 Difference]: Finished difference Result 34209 states and 61589 transitions. [2018-11-07 20:22:33,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 20:22:33,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2018-11-07 20:22:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:33,564 INFO L225 Difference]: With dead ends: 34209 [2018-11-07 20:22:33,564 INFO L226 Difference]: Without dead ends: 24791 [2018-11-07 20:22:33,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:22:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24791 states. [2018-11-07 20:22:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24791 to 24608. [2018-11-07 20:22:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24608 states. [2018-11-07 20:22:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24608 states to 24608 states and 39305 transitions. [2018-11-07 20:22:34,446 INFO L78 Accepts]: Start accepts. Automaton has 24608 states and 39305 transitions. Word has length 199 [2018-11-07 20:22:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:22:34,447 INFO L480 AbstractCegarLoop]: Abstraction has 24608 states and 39305 transitions. [2018-11-07 20:22:34,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:22:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24608 states and 39305 transitions. [2018-11-07 20:22:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 20:22:34,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:22:34,461 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:22:34,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:22:34,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash 446131319, now seen corresponding path program 1 times [2018-11-07 20:22:34,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:22:34,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:22:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:34,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:22:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:22:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:22:34,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:22:34,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:22:34,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:22:34,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:22:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:22:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:22:34,684 INFO L87 Difference]: Start difference. First operand 24608 states and 39305 transitions. Second operand 4 states. [2018-11-07 20:22:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:43,331 INFO L93 Difference]: Finished difference Result 62467 states and 103119 transitions. [2018-11-07 20:22:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:22:43,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-11-07 20:22:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:43,541 INFO L225 Difference]: With dead ends: 62467 [2018-11-07 20:22:43,541 INFO L226 Difference]: Without dead ends: 37865 [2018-11-07 20:22:43,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:22:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37865 states. [2018-11-07 20:22:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37865 to 37097. [2018-11-07 20:22:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37097 states. [2018-11-07 20:22:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37097 states to 37097 states and 53722 transitions. [2018-11-07 20:22:44,689 INFO L78 Accepts]: Start accepts. Automaton has 37097 states and 53722 transitions. Word has length 207 [2018-11-07 20:22:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:22:44,691 INFO L480 AbstractCegarLoop]: Abstraction has 37097 states and 53722 transitions. [2018-11-07 20:22:44,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:22:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37097 states and 53722 transitions. [2018-11-07 20:22:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 20:22:44,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:22:44,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:22:44,758 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:22:44,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -433421620, now seen corresponding path program 1 times [2018-11-07 20:22:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:22:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:44,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:22:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:44,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:22:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:22:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 102 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:22:45,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:22:45,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:22:45,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-11-07 20:22:45,615 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2231], [2233], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2796], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:22:45,671 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:22:45,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:22:46,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:22:46,564 INFO L272 AbstractInterpreter]: Visited 184 different actions 184 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 20:22:46,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:46,605 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:22:47,428 INFO L227 lantSequenceWeakener]: Weakened 339 states. On average, predicates are now at 75.44% of their original sizes. [2018-11-07 20:22:47,428 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:22:48,080 INFO L415 sIntCurrentIteration]: We unified 347 AI predicates to 347 [2018-11-07 20:22:48,080 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:22:48,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:22:48,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-07 20:22:48,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:22:48,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 20:22:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 20:22:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:22:48,084 INFO L87 Difference]: Start difference. First operand 37097 states and 53722 transitions. Second operand 9 states. [2018-11-07 20:22:55,547 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:23:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:23:30,701 INFO L93 Difference]: Finished difference Result 74958 states and 108442 transitions. [2018-11-07 20:23:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 20:23:30,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 348 [2018-11-07 20:23:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:23:31,960 INFO L225 Difference]: With dead ends: 74958 [2018-11-07 20:23:31,961 INFO L226 Difference]: Without dead ends: 37867 [2018-11-07 20:23:32,056 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 350 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 20:23:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37867 states. [2018-11-07 20:23:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37867 to 37865. [2018-11-07 20:23:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37865 states. [2018-11-07 20:23:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37865 states to 37865 states and 54503 transitions. [2018-11-07 20:23:32,819 INFO L78 Accepts]: Start accepts. Automaton has 37865 states and 54503 transitions. Word has length 348 [2018-11-07 20:23:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:23:32,819 INFO L480 AbstractCegarLoop]: Abstraction has 37865 states and 54503 transitions. [2018-11-07 20:23:32,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 20:23:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37865 states and 54503 transitions. [2018-11-07 20:23:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-11-07 20:23:32,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:23:32,874 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:23:32,875 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:23:32,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:23:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 818270158, now seen corresponding path program 1 times [2018-11-07 20:23:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:23:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:23:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:32,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:23:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:23:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 161 proven. 244 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 20:23:33,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:23:33,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:23:33,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 425 with the following transitions: [2018-11-07 20:23:33,718 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2231], [2233], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2796], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:23:33,731 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:23:33,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:23:34,363 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:23:34,363 INFO L272 AbstractInterpreter]: Visited 188 different actions 372 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:23:34,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:23:34,390 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:23:35,056 INFO L227 lantSequenceWeakener]: Weakened 421 states. On average, predicates are now at 75.41% of their original sizes. [2018-11-07 20:23:35,056 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:23:35,411 INFO L415 sIntCurrentIteration]: We unified 423 AI predicates to 423 [2018-11-07 20:23:35,411 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:23:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:23:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:23:35,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:23:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:23:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:23:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:23:35,413 INFO L87 Difference]: Start difference. First operand 37865 states and 54503 transitions. Second operand 11 states. [2018-11-07 20:23:38,813 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:24:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:24:04,528 INFO L93 Difference]: Finished difference Result 76498 states and 110163 transitions. [2018-11-07 20:24:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 20:24:04,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 424 [2018-11-07 20:24:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:24:04,651 INFO L225 Difference]: With dead ends: 76498 [2018-11-07 20:24:04,651 INFO L226 Difference]: Without dead ends: 37867 [2018-11-07 20:24:04,724 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 432 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:24:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37867 states. [2018-11-07 20:24:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37867 to 37865. [2018-11-07 20:24:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37865 states. [2018-11-07 20:24:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37865 states to 37865 states and 54501 transitions. [2018-11-07 20:24:05,525 INFO L78 Accepts]: Start accepts. Automaton has 37865 states and 54501 transitions. Word has length 424 [2018-11-07 20:24:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:24:05,526 INFO L480 AbstractCegarLoop]: Abstraction has 37865 states and 54501 transitions. [2018-11-07 20:24:05,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:24:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37865 states and 54501 transitions. [2018-11-07 20:24:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-11-07 20:24:05,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:05,614 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:05,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:05,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1034694878, now seen corresponding path program 1 times [2018-11-07 20:24:05,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:05,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 161 proven. 349 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 20:24:06,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:24:06,275 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:24:06,275 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 495 with the following transitions: [2018-11-07 20:24:06,276 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2231], [2233], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2796], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:24:06,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:24:06,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:24:06,376 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:24:06,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:24:06,655 INFO L272 AbstractInterpreter]: Visited 188 different actions 370 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:24:06,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:06,663 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:24:08,327 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 76.23% of their original sizes. [2018-11-07 20:24:08,328 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:24:08,928 INFO L415 sIntCurrentIteration]: We unified 493 AI predicates to 493 [2018-11-07 20:24:08,928 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:24:08,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:24:08,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-07 20:24:08,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:08,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 20:24:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 20:24:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:24:08,931 INFO L87 Difference]: Start difference. First operand 37865 states and 54501 transitions. Second operand 25 states. Received shutdown request... [2018-11-07 20:25:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 20:25:00,504 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:25:00,509 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:25:00,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:25:00 BoogieIcfgContainer [2018-11-07 20:25:00,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:25:00,510 INFO L168 Benchmark]: Toolchain (without parser) took 210721.76 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,512 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:25:00,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2288.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 333.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,514 INFO L168 Benchmark]: Boogie Preprocessor took 250.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,515 INFO L168 Benchmark]: RCFGBuilder took 9764.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 653.8 MB). Peak memory consumption was 653.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,516 INFO L168 Benchmark]: TraceAbstraction took 198079.92 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: -1.6 GB). Peak memory consumption was 753.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:25:00,523 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2288.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 333.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 250.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9764.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 653.8 MB). Peak memory consumption was 653.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198079.92 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: -1.6 GB). Peak memory consumption was 753.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 165]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 165). Cancelled while BasicCegarLoop was constructing difference of abstraction (37865states) and FLOYD_HOARE automaton (currently 31 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (69268 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 197.9s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 181.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5710 SDtfs, 21379 SDslu, 1341 SDs, 0 SdLazy, 43124 SolverSat, 7006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1333 GetRequests, 1237 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37865occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9981393038095508 AbsIntWeakeningRatio, 0.07363420427553444 AbsIntAvgWeakeningVarsNumRemoved, 18.83293745051465 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 7 MinimizatonAttempts, 1040 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 2028 ConstructedInterpolants, 0 QuantifiedInterpolants, 1904206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 655/1354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown