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/Problem13_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:31:25,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:31:25,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:31:25,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:31:25,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:31:25,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:31:25,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:31:26,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:31:26,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:31:26,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:31:26,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:31:26,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:31:26,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:31:26,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:31:26,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:31:26,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:31:26,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:31:26,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:31:26,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:31:26,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:31:26,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:31:26,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:31:26,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:31:26,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:31:26,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:31:26,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:31:26,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:31:26,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:31:26,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:31:26,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:31:26,041 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:31:26,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:31:26,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:31:26,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:31:26,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:31:26,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:31:26,046 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:31:26,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:31:26,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:31:26,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:31:26,075 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:31:26,075 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:31:26,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:31:26,075 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:31:26,075 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:31:26,076 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:31:26,076 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:31:26,076 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:31:26,076 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:31:26,076 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:31:26,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:31:26,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:31:26,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:31:26,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:31:26,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:31:26,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:31:26,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:31:26,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:31:26,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:31:26,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:31:26,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:31:26,080 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:31:26,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:31:26,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:31:26,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:31:26,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:31:26,081 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:31:26,081 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:31:26,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:31:26,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:31:26,085 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:31:26,085 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:31:26,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:31:26,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:31:26,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:31:26,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:31:26,174 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:31:26,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-07 20:31:26,245 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf0e6586/d99cc106db214b868910d4e3ce69b019/FLAG360db90b4 [2018-11-07 20:31:27,036 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:31:27,037 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-07 20:31:27,081 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf0e6586/d99cc106db214b868910d4e3ce69b019/FLAG360db90b4 [2018-11-07 20:31:27,097 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf0e6586/d99cc106db214b868910d4e3ce69b019 [2018-11-07 20:31:27,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:31:27,111 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:31:27,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:31:27,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:31:27,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:31:27,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:27" (1/1) ... [2018-11-07 20:31:27,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c9c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:27, skipping insertion in model container [2018-11-07 20:31:27,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:27" (1/1) ... [2018-11-07 20:31:27,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:31:27,326 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:31:28,747 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:31:28,752 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:31:29,505 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:31:29,537 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:31:29,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29 WrapperNode [2018-11-07 20:31:29,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:31:29,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:31:29,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:31:29,539 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:31:29,548 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:31:29" (1/1) ... [2018-11-07 20:31:29,914 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:31:29" (1/1) ... [2018-11-07 20:31:29,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:31:29,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:31:29,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:31:29,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:31:29,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:29,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:29,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:29,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:30,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:30,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:30,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (1/1) ... [2018-11-07 20:31:30,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:31:30,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:31:30,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:31:30,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:31:30,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (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:31:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:31:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:31:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:31:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:31:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:31:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:31:30,325 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:31:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:31:30,325 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:31:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:31:30,326 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:31:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:31:30,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:31:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:31:30,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:31:42,766 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:31:42,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:42 BoogieIcfgContainer [2018-11-07 20:31:42,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:31:42,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:31:42,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:31:42,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:31:42,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:31:27" (1/3) ... [2018-11-07 20:31:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e2b683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:42, skipping insertion in model container [2018-11-07 20:31:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:29" (2/3) ... [2018-11-07 20:31:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e2b683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:42, skipping insertion in model container [2018-11-07 20:31:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:42" (3/3) ... [2018-11-07 20:31:42,776 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label52_true-unreach-call.c [2018-11-07 20:31:42,787 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:31:42,800 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:31:42,816 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:31:42,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:31:42,865 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:31:42,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:31:42,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:31:42,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:31:42,865 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:31:42,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:31:42,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:31:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 20:31:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 20:31:42,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:31:42,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:31:42,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:31:42,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:31:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash -774157709, now seen corresponding path program 1 times [2018-11-07 20:31:42,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:31:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:42,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:31:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:42,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:31:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:31:43,511 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:31:43,703 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:31:43,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:31:43,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:31:43,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:31:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:31:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:31:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:31:43,754 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-11-07 20:31:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:31:52,455 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-11-07 20:31:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:31:52,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-07 20:31:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:31:52,491 INFO L225 Difference]: With dead ends: 3093 [2018-11-07 20:31:52,492 INFO L226 Difference]: Without dead ends: 1971 [2018-11-07 20:31:52,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:31:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-11-07 20:31:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-11-07 20:31:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-11-07 20:31:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-11-07 20:31:52,712 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 71 [2018-11-07 20:31:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:31:52,713 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-11-07 20:31:52,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:31:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-11-07 20:31:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 20:31:52,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:31:52,730 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, 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] [2018-11-07 20:31:52,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:31:52,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:31:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1438454356, now seen corresponding path program 1 times [2018-11-07 20:31:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:31:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:31:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:52,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:31:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:31:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:31:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:31:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:31:53,180 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:31:53,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:31:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:31:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:31:53,183 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-11-07 20:32:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:32:07,969 INFO L93 Difference]: Finished difference Result 5630 states and 10205 transitions. [2018-11-07 20:32:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:32:07,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-11-07 20:32:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:32:07,997 INFO L225 Difference]: With dead ends: 5630 [2018-11-07 20:32:07,997 INFO L226 Difference]: Without dead ends: 3679 [2018-11-07 20:32:08,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:32:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2018-11-07 20:32:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3636. [2018-11-07 20:32:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-11-07 20:32:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5828 transitions. [2018-11-07 20:32:08,123 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5828 transitions. Word has length 154 [2018-11-07 20:32:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:32:08,124 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 5828 transitions. [2018-11-07 20:32:08,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:32:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5828 transitions. [2018-11-07 20:32:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 20:32:08,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:32:08,138 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, 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] [2018-11-07 20:32:08,138 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:32:08,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:32:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1449223166, now seen corresponding path program 1 times [2018-11-07 20:32:08,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:32:08,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:08,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:32:08,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:08,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:32:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:32:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:32:08,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:32:08,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:32:08,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:32:08,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:32:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:32:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:32:08,452 INFO L87 Difference]: Start difference. First operand 3636 states and 5828 transitions. Second operand 5 states. [2018-11-07 20:32:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:32:23,988 INFO L93 Difference]: Finished difference Result 13450 states and 21898 transitions. [2018-11-07 20:32:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:32:23,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-11-07 20:32:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:32:24,056 INFO L225 Difference]: With dead ends: 13450 [2018-11-07 20:32:24,056 INFO L226 Difference]: Without dead ends: 9820 [2018-11-07 20:32:24,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:32:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2018-11-07 20:32:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9623. [2018-11-07 20:32:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9623 states. [2018-11-07 20:32:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 14633 transitions. [2018-11-07 20:32:24,357 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 14633 transitions. Word has length 161 [2018-11-07 20:32:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:32:24,358 INFO L480 AbstractCegarLoop]: Abstraction has 9623 states and 14633 transitions. [2018-11-07 20:32:24,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:32:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 14633 transitions. [2018-11-07 20:32:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 20:32:24,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:32:24,366 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, 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:32:24,371 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:32:24,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:32:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2036148572, now seen corresponding path program 1 times [2018-11-07 20:32:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:32:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:24,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:32:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:24,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:32:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:32:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:32:24,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:32:24,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:32:24,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:32:24,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:32:24,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:32:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:32:24,716 INFO L87 Difference]: Start difference. First operand 9623 states and 14633 transitions. Second operand 5 states. [2018-11-07 20:32:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:32:34,016 INFO L93 Difference]: Finished difference Result 28946 states and 45937 transitions. [2018-11-07 20:32:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:32:34,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-11-07 20:32:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:32:34,104 INFO L225 Difference]: With dead ends: 28946 [2018-11-07 20:32:34,104 INFO L226 Difference]: Without dead ends: 19329 [2018-11-07 20:32:34,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:32:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19329 states. [2018-11-07 20:32:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19329 to 18999. [2018-11-07 20:32:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2018-11-07 20:32:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 27487 transitions. [2018-11-07 20:32:34,614 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 27487 transitions. Word has length 170 [2018-11-07 20:32:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:32:34,615 INFO L480 AbstractCegarLoop]: Abstraction has 18999 states and 27487 transitions. [2018-11-07 20:32:34,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:32:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 27487 transitions. [2018-11-07 20:32:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 20:32:34,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:32:34,627 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, 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] [2018-11-07 20:32:34,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:32:34,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:32:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1111253638, now seen corresponding path program 1 times [2018-11-07 20:32:34,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:32:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:34,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:32:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:34,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:32:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:32:34,886 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:32:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:32:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:32:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:32:35,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:32:35,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:32:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:32:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:32:35,295 INFO L87 Difference]: Start difference. First operand 18999 states and 27487 transitions. Second operand 6 states. [2018-11-07 20:32:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:32:46,864 INFO L93 Difference]: Finished difference Result 58216 states and 91373 transitions. [2018-11-07 20:32:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:32:46,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-07 20:32:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:32:47,032 INFO L225 Difference]: With dead ends: 58216 [2018-11-07 20:32:47,033 INFO L226 Difference]: Without dead ends: 39223 [2018-11-07 20:32:47,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:32:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39223 states. [2018-11-07 20:32:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39223 to 39047. [2018-11-07 20:32:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39047 states. [2018-11-07 20:32:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39047 states to 39047 states and 54715 transitions. [2018-11-07 20:32:47,984 INFO L78 Accepts]: Start accepts. Automaton has 39047 states and 54715 transitions. Word has length 181 [2018-11-07 20:32:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:32:47,985 INFO L480 AbstractCegarLoop]: Abstraction has 39047 states and 54715 transitions. [2018-11-07 20:32:47,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:32:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39047 states and 54715 transitions. [2018-11-07 20:32:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 20:32:47,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:32:47,996 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, 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] [2018-11-07 20:32:47,996 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:32:47,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:32:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -747971991, now seen corresponding path program 1 times [2018-11-07 20:32:47,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:32:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:32:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:47,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:32:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:32:48,251 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:32:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:32:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:32:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:32:48,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:32:48,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:32:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:32:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:32:48,319 INFO L87 Difference]: Start difference. First operand 39047 states and 54715 transitions. Second operand 6 states. [2018-11-07 20:32:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:32:56,276 INFO L93 Difference]: Finished difference Result 98710 states and 156662 transitions. [2018-11-07 20:32:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:32:56,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-11-07 20:32:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:32:56,565 INFO L225 Difference]: With dead ends: 98710 [2018-11-07 20:32:56,566 INFO L226 Difference]: Without dead ends: 59669 [2018-11-07 20:32:56,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:32:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59669 states. [2018-11-07 20:32:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59669 to 59442. [2018-11-07 20:32:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59442 states. [2018-11-07 20:32:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59442 states to 59442 states and 85231 transitions. [2018-11-07 20:32:58,128 INFO L78 Accepts]: Start accepts. Automaton has 59442 states and 85231 transitions. Word has length 190 [2018-11-07 20:32:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:32:58,128 INFO L480 AbstractCegarLoop]: Abstraction has 59442 states and 85231 transitions. [2018-11-07 20:32:58,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:32:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59442 states and 85231 transitions. [2018-11-07 20:32:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-07 20:32:58,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:32:58,728 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,728 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:32:58,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:32:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1403677423, now seen corresponding path program 1 times [2018-11-07 20:32:58,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:32:58,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:58,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:32:58,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:32:58,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:32:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:32:59,077 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:32:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:32:59,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:32:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:32:59,500 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:32:59,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:32:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:32:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:32:59,501 INFO L87 Difference]: Start difference. First operand 59442 states and 85231 transitions. Second operand 6 states. [2018-11-07 20:33:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:06,677 INFO L93 Difference]: Finished difference Result 124489 states and 183187 transitions. [2018-11-07 20:33:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:33:06,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-07 20:33:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:06,976 INFO L225 Difference]: With dead ends: 124489 [2018-11-07 20:33:06,977 INFO L226 Difference]: Without dead ends: 65053 [2018-11-07 20:33:07,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:33:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65053 states. [2018-11-07 20:33:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65053 to 64927. [2018-11-07 20:33:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64927 states. [2018-11-07 20:33:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64927 states to 64927 states and 87972 transitions. [2018-11-07 20:33:08,957 INFO L78 Accepts]: Start accepts. Automaton has 64927 states and 87972 transitions. Word has length 265 [2018-11-07 20:33:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:08,958 INFO L480 AbstractCegarLoop]: Abstraction has 64927 states and 87972 transitions. [2018-11-07 20:33:08,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:33:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 64927 states and 87972 transitions. [2018-11-07 20:33:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 20:33:08,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:08,988 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,988 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:08,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2001119171, now seen corresponding path program 1 times [2018-11-07 20:33:08,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:08,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:08,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:33:09,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:09,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:33:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:33:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:33:09,336 INFO L87 Difference]: Start difference. First operand 64927 states and 87972 transitions. Second operand 5 states. [2018-11-07 20:33:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:24,619 INFO L93 Difference]: Finished difference Result 165884 states and 236667 transitions. [2018-11-07 20:33:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:33:24,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2018-11-07 20:33:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:25,017 INFO L225 Difference]: With dead ends: 165884 [2018-11-07 20:33:25,017 INFO L226 Difference]: Without dead ends: 100963 [2018-11-07 20:33:25,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:33:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100963 states. [2018-11-07 20:33:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100963 to 100796. [2018-11-07 20:33:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100796 states. [2018-11-07 20:33:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100796 states to 100796 states and 143272 transitions. [2018-11-07 20:33:27,236 INFO L78 Accepts]: Start accepts. Automaton has 100796 states and 143272 transitions. Word has length 271 [2018-11-07 20:33:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:27,236 INFO L480 AbstractCegarLoop]: Abstraction has 100796 states and 143272 transitions. [2018-11-07 20:33:27,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:33:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 100796 states and 143272 transitions. [2018-11-07 20:33:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-07 20:33:27,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:27,265 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:27,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:27,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -227591905, now seen corresponding path program 1 times [2018-11-07 20:33:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:27,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:27,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 205 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:28,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:33:28,182 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:33:28,183 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-07 20:33:28,187 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:33:28,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:33:28,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:33:30,066 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:33:30,068 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 20:33:30,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:30,121 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:33:31,243 INFO L227 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 71.77% of their original sizes. [2018-11-07 20:33:31,244 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:33:32,102 INFO L415 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-11-07 20:33:32,103 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:33:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:33:32,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-11-07 20:33:32,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:32,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:33:32,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:33:32,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:33:32,105 INFO L87 Difference]: Start difference. First operand 100796 states and 143272 transitions. Second operand 11 states. [2018-11-07 20:33:47,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:42,097 INFO L93 Difference]: Finished difference Result 201588 states and 286571 transitions. [2018-11-07 20:34:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 20:34:42,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-11-07 20:34:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:42,408 INFO L225 Difference]: With dead ends: 201588 [2018-11-07 20:34:42,408 INFO L226 Difference]: Without dead ends: 100798 [2018-11-07 20:34:42,561 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:34:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100798 states. [2018-11-07 20:34:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100798 to 100793. [2018-11-07 20:34:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100793 states. [2018-11-07 20:34:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100793 states to 100793 states and 143218 transitions. [2018-11-07 20:34:45,348 INFO L78 Accepts]: Start accepts. Automaton has 100793 states and 143218 transitions. Word has length 282 [2018-11-07 20:34:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:45,348 INFO L480 AbstractCegarLoop]: Abstraction has 100793 states and 143218 transitions. [2018-11-07 20:34:45,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:34:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 100793 states and 143218 transitions. [2018-11-07 20:34:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-07 20:34:45,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:45,379 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, 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, 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] [2018-11-07 20:34:45,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:45,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1307204526, now seen corresponding path program 1 times [2018-11-07 20:34:45,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:45,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:45,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:46,409 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 20:34:46,685 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:34:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 296 proven. 172 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:34:46,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:46,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:46,995 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 384 with the following transitions: [2018-11-07 20:34:46,997 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:34:47,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:47,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:47,377 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:47,377 INFO L272 AbstractInterpreter]: Visited 128 different actions 371 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:34:47,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:47,387 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:48,299 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 71.41% of their original sizes. [2018-11-07 20:34:48,299 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-11-07 20:34:48,893 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:34:48,897 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:34:48,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:34:48 BoogieIcfgContainer [2018-11-07 20:34:48,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:34:48,898 INFO L168 Benchmark]: Toolchain (without parser) took 201788.58 ms. Allocated memory was 1.5 GB in the beginning and 5.6 GB in the end (delta: 4.0 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -485.7 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,899 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:34:48,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2426.35 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 385.58 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 829.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,902 INFO L168 Benchmark]: Boogie Preprocessor took 323.44 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,902 INFO L168 Benchmark]: RCFGBuilder took 12519.00 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 147.3 MB). Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 61.0 MB). Peak memory consumption was 661.0 MB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,903 INFO L168 Benchmark]: TraceAbstraction took 186129.37 ms. Allocated memory was 2.5 GB in the beginning and 5.6 GB in the end (delta: 3.1 GB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 295.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:34:48,909 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2426.35 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 385.58 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 829.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 323.44 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12519.00 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 147.3 MB). Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 61.0 MB). Peak memory consumption was 661.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186129.37 ms. Allocated memory was 2.5 GB in the beginning and 5.6 GB in the end (delta: 3.1 GB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 295.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 204]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 204). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 4,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 186.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 162.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4443 SDtfs, 30440 SDslu, 4283 SDs, 0 SdLazy, 52436 SolverSat, 10891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 359 GetRequests, 292 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100796occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9979652714435322 AbsIntWeakeningRatio, 0.09954751131221719 AbsIntAvgWeakeningVarsNumRemoved, 6.306184012066365 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1285 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1745 NumberOfCodeBlocks, 1745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 653/666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown